Revision as of 05:29, 15 April 2011 edit Ilyanep (talk \| contribs) Administrators 7,063 edits m →See also: rm link to deleted page ← Previous edit		Revision as of 00:00, 23 June 2011 edit undo Edward (talk \| contribs) Administrators 94,541 edits m link computational complexity theory using Find link Next edit →
Line 1: '''Average-case complexity''' is a subfield of [[computational complexity]] theory]] that studies the complexity of algorithms on random inputs. The study of average-case complexity has applications in the theory of [[cryptography]].

Average-case complexity: Difference between revisions