388 search results - page 13 / 78 » Quantum Lower Bounds by Polynomials |
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...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
ECCC
2010
13 years 6 months ago
2010
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales b...
DAGSTUHL
2007
13 years 8 months ago
2007
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
ICALP
2001
Springer
13 years 11 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...