84
Voted
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
86
Voted
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
86
Voted
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
156
Voted
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
128
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
148
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
147
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
120
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...