Sciweavers

Share
43 search results - page 1 / 9
» Lower Bounds for Randomized and Quantum Query Complexity Usi...
Sort
View
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
10 years 7 months ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez
CIE
2006
Springer
10 years 5 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
11 years 1 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
11 years 1 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
FOCS
1998
IEEE
10 years 5 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
books