Average Case Complexity under the Universal Distribution Equals Worst Case Complexity (1992)
by
Ming Li
,
Paul M.B. Vitányi
| Venue: | INFORMATION PROCESSING LETTERS |
| Citations: | 26 - 0 self |
BibTeX
@ARTICLE{Li92averagecase,
author = {Ming Li and Paul M.B. Vitányi},
title = {Average Case Complexity under the Universal Distribution Equals Worst Case Complexity},
journal = {INFORMATION PROCESSING LETTERS},
year = {1992},
volume = {42},
pages = {145--149}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The average complexity of any algorithm whatsoever (provided it always terminates) under the universal distribution is of the same order of magnitude as the worst-case complexity. This holds both for time complexity and for space complexity. To focus our discussion, we use as illustrations the particular case of sorting algorithms, and the general case of the average case complexity of NP-complete problems.
