3415 search results - page 187 / 683 » Lower bounds on kernelization |
142
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
152
click to vote
DC
2006
15 years 6 months ago
2006
Some well-known primitive operations, such as compare-and-swap, can be used, together with read and write, to implement any object in a wait-free manner. However, this paper shows ...
188
click to vote
PAAPP
2000
15 years 5 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
182
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
177
click to vote
MST
2010
15 years 4 months ago
2010
We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an operator f : {0, 1}n → {0, 1}m as the logarithm of the maximu...