Kolmogorov Complexity and Computational Complexity - Monographs in Theoretical Computer Science. An EATCS Series - Osamu Watanabe - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783642777370 - December 21, 2011
In case cover and title do not match, the title is correct

Osamu Watanabe
Kolmogorov Complexity and Computational Complexity - Monographs in Theoretical Computer Science. An EATCS Series Softcover reprint of the original 1st ed. 1992 edition

Price
€ 92.49
excl. VAT

Ordered from remote warehouse

Expected delivery Dec 15 - 25
Christmas presents can be returned until 31 January

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

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.

105 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released December 21, 2011
ISBN13 9783642777370
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 105
Dimensions 155 × 235 × 6 mm   ·   176 g
Language German  
Editor Watanabe, Osamu
Show all

More by Osamu Watanabe

See all of Osamu Watanabe ( e.g. Paperback Book )