Revision as of 00:20, 3 August 2008 edit Erxnmedia (talk \| contribs) Autopatrolled, Extended confirmed users 3,864 edits No edit summary ← Previous edit		Revision as of 02:45, 3 August 2008 edit undo Erxnmedia (talk \| contribs) Autopatrolled, Extended confirmed users 3,864 edits wikilink Next edit →
Line 9: * 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. * L.[[Leonid Levin]]. Average case complete problems. SIAM J. Comput., 15:285–286, 1986. * ~~R¨udiger~~Rudiger Reischuk and Christian Schindelhauer. Precise average case complexity. In 10th Annual Symposium on Theoretical Aspects of Computer Science, pages 650–661, 1993. * 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. * R. Venkatesan and S. Rajagopalan. Average case intractability of matrix and Diophantine problems. In 24th Annual ACM STOC, pages 632–642, May 1992.

Average-case complexity: Difference between revisions