3208 search results - page 44 / 642 » A Lower Bound for Primality |
JACM
2002
13 years 9 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
MASCOTS
2007
13 years 11 months ago
2007
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
EUROPAR
2009
Springer
14 years 4 months ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
COMPUTING
2007
13 years 10 months ago
2007
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...