Average case completeness

Journal of Computer and System Sciences

Volumn 42, Issue 3, 1991, Pages 346-398

  Gurevich, Yuri ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - COMPUTATIONAL COMPLEXITY; PROBABILITY - RANDOM PROCESSES;

AVERAGE CASE COMPLETENESS; COMPLEXITY CLASSES; DECISION PROBLEMS; DETERMINISTIC REDUCTIONS; RANDOMIZED HALTING; REDUCIBILITY;

AUTOMATA THEORY;

EID: 0026172323     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(91)90007-R     Document Type: Article

References (26)

1. On the theory of average case complexity
2. An algorithm for finding Hamilton cycles in a random graph
3. On the theory of average case complexity
4. On the Computational Complexity of Scheme Equivalences
5. Complete and incomplete randomized NP problems
6. The challenger-Solver game: Variations on the theme of P=?NP
7. Expected computation time for Hamiltonian path problem
8. The NP-completeness column
9. On the definition of some complexity classes of real numbers
10. Average case complete problems
11. Complexity results for classes of quantificational formulas
12. On Finding a Minimum Dominating Set in a Tournament
13. Are the Vertex Cover and the Dominating Set Problems Equally Hard?
14. Average polynomial time complexity of some NP-complete problems
15. Random instances of a graph coloring problem are hard
16. Some examples of combinatorial averaging
17. The complexity of finite objects and the algorithmic concepts of information and randomness
18. No better ways to generate hard instances than picking uniformly at random