Average case complete problems
SIAM Journal on Computing
Random-self-reducibility of complete sets
SIAM Journal on Computing
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Threshold Computation and Cryptographic Security
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
A personal view of average-case complexity
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
The complexity of constructing pseudorandom generators from hard functions
Computational Complexity
On Constructing Parallel Pseudorandom Generators from One-Way Functions
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Foundations and Trends® in Theoretical Computer Science
On Worst-Case to Average-Case Reductions for NP Problems
SIAM Journal on Computing
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
One-way functions are essential for complexity based cryptography
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
No better ways to generate hard NP instances than picking uniformly at random
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Worst-Case to Average-Case Reductions Revisited
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
| Hi-index | 0.00 |
We prove that relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to errorless-average-case reductions. In fact, we prove that relative to an oracle, there is no worst-case to errorless-average-case reduction from NP to BPPpath. The latter class contains P||NP and captures the power of randomized computations conditioned on efficiently testable events. We also handle reductions from NP to the polynomial-time hierarchy and beyond, under restrictions on the number of queries the reductions can make.