388 search results - page 10 / 78 » Quantum Lower Bounds by Polynomials |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
COCOON
2007
Springer
14 years 27 days ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
COCO
2007
Springer
14 years 27 days ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
COCO
1997
Springer
13 years 11 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...