388 search results - page 12 / 78 » Quantum Lower Bounds by Polynomials |
CORR
2008
Springer
15 years 1 months ago
2008
Springer
122
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
112
click to vote
COCO
2003
Springer
15 years 7 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
123
click to vote
ALGORITHMICA
2010
15 years 1 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
AAECC
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie