16 search results - page 1 / 4 » Functions Computable with Nonadaptive Queries to NP |
MST
1998
13 years 4 months ago
1998
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We show that if an NP-complete problem has a non-adaptive self-corrector with respect to a samplable distribution then coNP is contained in NP/poly and the polynomial hierarchy co...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
EUROCRYPT
2006
Springer
13 years 9 months ago
2006
Springer
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...