Kolmogorov Complexity and Computational Complexity by Osamu Watanabe (Paperback, 2011)

plsshipfast (11111)
98.6% positive Feedback
Price:
£70.31
Free postage
Estimated delivery Tue, 22 Jul - Wed, 30 Jul
Returns:
30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.
Condition:
New
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. In response, five speakers from the sessions contributed the papers which appear in this book.

About this product

Product Information

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.

Product Identifiers

PublisherSpringer-Verlag Berlin AND Heidelberg Gmbh & Co. KG
ISBN-139783642777370
eBay Product ID (ePID)117389074

Product Key Features

Number of Pages105 Pages
LanguageEnglish
Publication NameKolmogorov Complexity and Computational Complexity
Publication Year2011
SubjectComputer Science, Mathematics
TypeTextbook
AuthorOsamu Watanabe
SeriesMonographs in Theoretical Computer Science. an Eatcs Series
FormatPaperback

Dimensions

Item Height235 mm
Item Weight196 g
Item Width155 mm

Additional Product Features

EditorOsamu Watanabe
Country/Region of ManufactureGermany

All listings for this product

Buy it now
New
No ratings or reviews yet
Be the first to write a review