The NP-completeness column: An ongoing guide
Journal of Algorithms
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
Random instances of a graph coloring problem are hard
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the theory of average case complexity
Journal of Computer and System Sciences
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
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
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective
Complete and incomplete randomized NP problems
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Homogeneous measures and polynomial time invariants
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Matrix decomposition problem is complete for the average case
SFCS '90 Proceedings of the 31st 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
All Natural NP-Complete Problems Have Average-Case Complete Versions
Computational Complexity
Average case complexity, revisited
Studies in complexity and cryptography
| Hi-index | 0.00 |
In 1984, Leonid Levin initiated a theory of average-case complexity. We provide an exposition of the basic definitions suggested by Levin, and discuss some of the considerations underlying these definitions.