3415 search results - page 287 / 683 » Lower bounds on kernelization |
176
click to vote
FOSSACS
2007
Springer
16 years 27 days ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
191
click to vote
VTS
2006
IEEE
16 years 22 days ago
2006
IEEE
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
163
click to vote
WIOPT
2006
IEEE
16 years 22 days ago
2006
IEEE
Abstract— We investigate two quantities of fundamental interest in a mobile ad-hoc network: the capacity region and the minimum energy function of the network. The capacity regio...
154
click to vote
SIGECOM
2005
ACM
16 years 8 days ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
142
click to vote
CRYPTO
2005
Springer
16 years 8 days ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...