Kolmogorov Complexity and Computational Complexity (E A T C S MONOGRAPHS ON THEORETICAL COMPUTER SCIENCE)

0 avg rating
( 0 ratings by Goodreads )
 
9780387558400: Kolmogorov Complexity and Computational Complexity (E A T C S MONOGRAPHS ON THEORETICAL COMPUTER SCIENCE)
View all copies of this ISBN edition:
 
 

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.

"synopsis" may belong to another edition of this title.

Buy New View Book
List Price: US$ 49.95
US$ 46.09

Convert Currency

Shipping: US$ 7.30
From United Kingdom to U.S.A.

Destination, Rates & Speeds

Add to Basket

Other Popular Editions of the Same Title

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

Featured Edition

ISBN 10:  3642777376 ISBN 13:  9783642777370
Publisher: Springer, 2011
Softcover

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

Springer, 1992
Hardcover

Top Search Results from the AbeBooks Marketplace

1.

Published by Springer
ISBN 10: 0387558403 ISBN 13: 9780387558400
New Quantity Available: 1
Seller:
Majestic Books
(London, ,, United Kingdom)
Rating
[?]

Book Description Springer. Condition: New. pp. 105. Seller Inventory # 5772638

More information about this seller | Contact this seller

Buy New
US$ 46.09
Convert Currency

Add to Basket

Shipping: US$ 7.30
From United Kingdom to U.S.A.
Destination, Rates & Speeds

2.

Osamu Watanabe (Editor)
Published by Springer-Verlag (1992)
ISBN 10: 0387558403 ISBN 13: 9780387558400
New Hardcover Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Springer-Verlag, 1992. Hardcover. Condition: New. Seller Inventory # DADAX0387558403

More information about this seller | Contact this seller

Buy New
US$ 68.03
Convert Currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, Rates & Speeds

3.

Published by Springer Verlag (1992)
ISBN 10: 0387558403 ISBN 13: 9780387558400
New Hardcover Quantity Available: 1
Seller:
Irish Booksellers
(Portland, ME, U.S.A.)
Rating
[?]

Book Description Springer Verlag, 1992. Condition: New. book. Seller Inventory # M0387558403

More information about this seller | Contact this seller

Buy New
US$ 211.44
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds