Revision as of 22:49, 13 August 2008 edit Erxnmedia (talk \| contribs) Autopatrolled, Extended confirmed users 3,864 edits wikilink author ← Previous edit		Revision as of 12:41, 14 August 2008 edit undo Erxnmedia (talk \| contribs) Autopatrolled, Extended confirmed users 3,864 edits wikilink paper Next edit →
Line 8: * [[Philippe Flajolet]] and [[Jeffrey Vitter\|J.S. Vitter]]. Average-case analysis of algorithms and data structures. Technical report, Institut National de Recherche en Informatique et en Automatique, B.P. 105-78153 Le Chesnay Cedex France, August 1987. * Shai Ben-David, Benny Chor, [[Oded Goldreich]], and [[Michael Luby]]. On the theory of average case complexity. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 204–216. ACM, 1989. * [[Yuri Gurevich]]. Average case completeness. Journal of Computer and`System Sciences, 42:346–398, 1991. See also [http://research.microsoft.com/~gurevich/Opera/76.pdf 1989 draft]. * B. Selman D. Mitchell and H. Levesque. Hard and easy distributions of SAT problems. In Proceedings of the 10th National Conference on Artificial Intelligence, pages 459–465, 1992. * Rainer Schuler and Tomoyuki Yamakami. Structural average case complexity. In Foundations of Software Technology and Theoretical Computer Science, pages 128–139. Springer-Verlag Lecture Notes in Computer Science #652, 1992.

Average-case complexity: Difference between revisions