Average case complexity under the universal distribution equals worst- case complexity (Q1198047)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 92108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average case complexity under the universal distribution equals worst- case complexity |
scientific article; zbMATH DE number 92108 |
Statements
Average case complexity under the universal distribution equals worst- case complexity (English)
0 references
16 January 1993
0 references
analysis of algorithms
0 references
Kolmogorov complexity
0 references
uniform distribution
0 references
quicksort
0 references
average NP completeness
0 references
average complexity
0 references
universal distribution
0 references
worst-case complexity
0 references
time complexity
0 references
space complexity
0 references
sorting
0 references
0.800040066242218
0 references
0.7993965744972229
0 references
0.7975180745124817
0 references
