59 search results - page 12 / 12 » Nonadaptive quantum query complexity |
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
SIAMCOMP
2010
13 years 16 days ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
FOCS
2008
IEEE
14 years 7 days ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...