3208 search results - page 265 / 642 » A Lower Bound for Primality |
187
click to vote
COCOON
2007
Springer
16 years 25 days ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
173
click to vote
FOSSACS
2007
Springer
16 years 25 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 20 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...
160
click to vote
WIOPT
2006
IEEE
16 years 20 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...
153
click to vote
SIGECOM
2005
ACM
16 years 6 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, ...