Revision as of 02:47, 3 August 2008 edit Erxnmedia (talk \| contribs) Autopatrolled, Extended confirmed users 3,864 edits wikilink ← Previous edit		Revision as of 02:49, 3 August 2008 edit undo Erxnmedia (talk \| contribs) Autopatrolled, Extended confirmed users 3,864 edits wikilink Next edit →
Line 7: * 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. * John Franco. On the probabilistic performance of algorithms for the satisfiability problem. Information Processing Letters, 3:103–106, 1986. * [[Philippe Flajolet]] and 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. * [[Yuri Gurevich]]. Average case completeness. Journal of Computer and`System Sciences, 42:346–398, 1991. * [[Leonid Levin]]. Average case complete problems. SIAM J. Comput., 15:285–286, 1986.

Average-case complexity: Difference between revisions