Average case complete problems
SIAM Journal on Computing
One-way functions and pseudorandom generators
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Are search and decision programs computationally equivalent?
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Random instances of a graph coloring problem are hard
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The complexity of approximate counting
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
CRYPTO '89 Proceedings on Advances in cryptology
Average case intractability of matrix and diophantine problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Towards practical “proven secure” authenticated key distribution
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Cryptanalysis of the Chang-Wu-Chen key distribution system
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
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
Batch Diffie-Hellmam key agreement systems and their application to portable communications
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A. Levin. Previous works [Levin 84, Gurevich 87, Venkatesan and Levin 88] have focused on the existence of complete problems. We widen the scope to other basic questions in computational complexity. Our results include:the equivalence of search and decision problems in the context of average case complexity;an initial analysis of the structure of distributional-NP under reductions which preserve average polynomial-time;a proof that if all distributional-NP is in average polynomial-time then non-deterministic exponential-time equals deterministic exponential time (i.e., a collapse in the worst case hierarchy);definitions and basic theorems regarding other complexity classes such as average log-space.