Using randomness to characterize the complexity of computation

Abstract: "Kolmogorov complexity -- the study of the randomness of strings -- has developed into a fundamental tool in proving lower bounds in computation and in constructing oracles separating complexity classes. In this paper, we show that Kolmogorov complexity is a central tool in the unders...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Hemachandra, Lane A. (VerfasserIn), Wechsung, Gerd 1939- (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Rochester, NY 1989
Schriftenreihe:	University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 286
Schlagworte:	Computational complexity Random fields
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!