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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Kolmogorov Complexity and Computational Complexity
Image d'archives
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020236143
Acheter neuf
EUR 102,92
Frais de port :
EUR 3,44
Vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783642777370_new
Acheter neuf
EUR 108,38
Frais de port :
EUR 13,57
De Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Kolmogorov Complexity and Computational Complexity
Edité par
Springer, Springer Vieweg Dez 2011, 2011
ISBN 10 : 3642777376
ISBN 13 : 9783642777370
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783642777370
Acheter neuf
EUR 106,99
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Kolmogorov Complexity and Computational Complexity
Edité par
Springer Berlin Heidelberg, 2011
ISBN 10 : 3642777376
ISBN 13 : 9783642777370
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 5070379
Acheter neuf
EUR 92,27
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image d'archives
Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An Eatcs Series)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. reprint edition. 112 pages. 9.25x6.10x0.02 inches. In Stock. N° de réf. du vendeur x-3642777376
Acheter neuf
EUR 149,13
Frais de port :
EUR 11,33
De Royaume-Uni vers Etats-Unis
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Kolmogorov Complexity and Computational Complexity
Vendeur : preigu, Osnabrück, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 106331912
Acheter neuf
EUR 95,80
Frais de port :
EUR 70
De Allemagne vers Etats-Unis
Quantité disponible : 5 disponible(s)
Image fournie par le vendeur
Kolmogorov Complexity and Computational Complexity
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2011, 2011
ISBN 10 : 3642777376
ISBN 13 : 9783642777370
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783642777370
Acheter neuf
EUR 106,99
Frais de port :
EUR 60
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Kolmogorov Complexity and Computational Complexity
Edité par
Springer Berlin Heidelberg, 2011
ISBN 10 : 3642777376
ISBN 13 : 9783642777370
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783642777370
Acheter neuf
EUR 106,99
Frais de port :
EUR 60,98
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)