130 search results - page 9 / 26 » Optimal Lower Bounds on Regular Expression Size Using Commun... |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
LMCS
2007
13 years 7 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
SIROCCO
2004
13 years 9 months ago
2004
A black hole is a harmful host that destroys incoming agents without leaving any observable trace of such a destruction. The black hole search problem is to unambiguously determine...
GECCO
2010
Springer
14 years 10 days ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...