Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series) - Softcover
Synopsis
This book contains five survey papers on recent research on Kolmogorov complexity (in particular resource bounded Kolmogorov complexity) and its relation to structural and computational complexity.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Kolmogorov Complexity and Computational Complexity...
Stock Image
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9783642777370
Stock Image
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020236143
Stock Image
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642777370_new
Buy New
£ 92.87
Shipping:
£ 11.98
From United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Kolmogorov Complexity and Computational Complexity
Published by
Springer, Springer Vieweg Dez 2011, 2011
ISBN 10: 3642777376
ISBN 13: 9783642777370
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 120 pp. Englisch. Seller Inventory # 9783642777370
Seller Image
Kolmogorov Complexity and Computational Complexity
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642777376
ISBN 13: 9783642777370
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 5070379
Stock Image
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An Eatcs Series)
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. reprint edition. 112 pages. 9.25x6.10x0.02 inches. In Stock. Seller Inventory # x-3642777376
Seller Image
Kolmogorov Complexity and Computational Complexity
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Kolmogorov Complexity and Computational Complexity | Osamu Watanabe | Taschenbuch | VII | Englisch | 2011 | Springer | EAN 9783642777370 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 106331912
Seller Image
Kolmogorov Complexity and Computational Complexity
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2011, 2011
ISBN 10: 3642777376
ISBN 13: 9783642777370
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 120 pp. Englisch. Seller Inventory # 9783642777370
Seller Image
Kolmogorov Complexity and Computational Complexity
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642777376
ISBN 13: 9783642777370
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642777370