Average-case computational complexity theory (1997)
| Venue: | Complexity Theory Retrospective II |
| Citations: | 30 - 2 self |
BibTeX
@INPROCEEDINGS{Wang97average-casecomputational,
author = {Jie Wang},
title = {Average-case computational complexity theory},
booktitle = {Complexity Theory Retrospective II},
year = {1997},
pages = {295--328},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ABSTRACT Being NP-complete has been widely interpreted as being computationally intractable. But NP-completeness is a worst-case concept. Some NP-complete problems are \easy on average", but some may not be. How is one to know whether an NP-complete problem is \di cult on average"? The theory of average-case computational complexity, initiated by Levin about ten years ago, is devoted to studying this problem. This paper is an attempt to provide an overview of the main ideas and results in this important new sub-area of complexity theory. 1
