Cantitate/Preț
Produs

Kolmogorov Complexity and Computational Complexity: Monographs in Theoretical Computer Science. An EATCS Series

Editat de Osamu Watanabe
en Limba Engleză Paperback – 21 dec 2011
The mathematical theory of computation has given rise to two important ap­ proaches to the informal notion of "complexity": Kolmogorov complexity, usu­ ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the object. Compu­ tational complexity, usually a complexity measure for a set of objects, measures the compuational resources necessary to recognize or produce elements of the set. The relation between these two complexity measures has been considered for more than two decades, and may interesting and deep observations have been obtained. In March 1990, the Symposium on Theory and Application of Minimal­ Length Encoding was held at Stanford University as a part of the AAAI 1990 Spring Symposium Series. Some sessions of the symposium were dedicated to Kolmogorov complexity and its relations to the computational complexity the­ ory, and excellent expository talks were given there. Feeling that, due to the importance of the material, some way should be found to share these talks with researchers in the computer science community, I asked the speakers of those sessions to write survey papers based on their talks in the symposium. In response, five speakers from the sessions contributed the papers which appear in this book.
Citește tot Restrânge

Din seria Monographs in Theoretical Computer Science. An EATCS Series

Preț: 60313 lei

Preț vechi: 75391 lei
-20% Nou

Puncte Express: 905

Preț estimativ în valută:
11547 12511$ 9642£

Carte tipărită la comandă

Livrare economică 12-26 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642777370
ISBN-10: 3642777376
Pagini: 120
Ilustrații: VII, 105 p.
Dimensiuni: 155 x 235 x 6 mm
Greutate: 0.18 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory.- On Sets with Small Information Content.- Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness.- Resource Bounded Kolmogorov Complexity and Statistical Tests.- Complexity and Entropy: An Introduction to the Theory of Kolmogorov Complexity.