Average-case analysis of algorithms using Kolmogorov complexity

Analyzing the average-case complexity of algorithms is a very practical but very difficult problem in computer science. In the past few years, we have demonstrated that Kolmogorov complexity is an important tool for analyzing the average-case complexity of algorithms. We have developed the incompres...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer science and technology Jg. 15; H. 5; S. 402 - 408
Hauptverfasser: Jiang, Tao, Li, Ming, Vitányi, Paul M. B.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Beijing Springer Nature B.V 01.09.2000
Department of Computing Science, University of California, Riverside, CA 92521, USA%Department of Computer Science, University of California, Santa Barbara, CA 93106, USA%CWI and University of Amsterdam, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands
Schlagworte:
Algorithms
Complexity
Incompressibility
Queues
Sorting
Stacks
Studies
average-case analysis
Kolmogorov complexity
sorting
algorithm
ISSN:1000-9000, 1860-4749
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Analyzing the average-case complexity of algorithms is a very practical but very difficult problem in computer science. In the past few years, we have demonstrated that Kolmogorov complexity is an important tool for analyzing the average-case complexity of algorithms. We have developed the incompressibility method. In this paper, several simple examples are used to further demonstrate the power and simplicity of such method. We prove bounds on the average-case number of stacks (queues) required for sorting sequential or parallel Queuesort or Stacksort.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02950402