FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
FOCS
2003
IEEE
14 years 29 days 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...
FOCS
2003
IEEE
14 years 29 days 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...
FOCS
2003
IEEE
14 years 29 days 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...
FOCS
2003
IEEE
14 years 29 days 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...