Part of the Lecture Notes in Computer Science book series (LNCS, volume 533)
On the reduction theory for average case complexity
This is an attempt to simplify and justify the notions of deterministic and randomized reductions, an attempt to derive these notions from (more or less) first principles.
KeywordsRandom Function Positive Probability Binary String Computable Function Total Function
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [BCGL]Shai Ben-David, Benny Chor, Oded Goldreich and Michael Luby, “On the Theory of Average Case Complexity”, Symposium on Theory of Computing, ACM, 1989, 204–216.Google Scholar
- [Gu1]Yuri Gurevich, “Average Case Complexity”, J. Computer and System Sciences (a special issue on FOCS'87) to appear.Google Scholar
- [Gu2]Yuri Gurevich, “Matrix Decomposition Problem is Complete for the Average Case”, Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990, 802–811.Google Scholar
- [GJ][GJ]Michael R. Garey and David S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Freeman, New York, 1979.Google Scholar
- [IL]Russel Impagliazzo and Leonid A. Levin, “No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random”, Symposium on Foundations of Computers Science, IEEE Computer Soviety Press, 1990, 812–821.Google Scholar
- [Le]Leonid A. Levin, “Average Case Complete Problems”, SIAM Journal of Computing, 1986.Google Scholar
- [VL]Ramarathnam Venkatesan and Leonid Levin, “Random Instances of a Graph Coloring Problem are Hard”, Symposium on Theory of Computing, ACM, 1988, 217–222.Google Scholar
© Springer-Verlag Berlin Heidelberg 1991