Monographs in Theoretical Computer Science. An EATCS Series

Kolmogorov Complexity and Computational Complexity

Editors: Watanabe, Osamu (Ed.)

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-642-77735-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $149.00
price for USA
  • ISBN 978-3-642-77737-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (6 chapters)

  • Introduction

    Watanabe, Osamu

    Pages 1-3

  • Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory

    Allender, Eric

    Pages 4-22

  • On Sets with Small Information Content

    Book, Ronald V.

    Pages 23-42

  • Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness

    Juedes, David W. (et al.)

    Pages 43-65

  • Resource Bounded Kolmogorov Complexity and Statistical Tests

    Longpré, Luc

    Pages 66-84

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-642-77735-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $149.00
price for USA
  • ISBN 978-3-642-77737-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Kolmogorov Complexity and Computational Complexity
Editors
  • Osamu Watanabe
Series Title
Monographs in Theoretical Computer Science. An EATCS Series
Copyright
1992
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-642-77735-6
DOI
10.1007/978-3-642-77735-6
Softcover ISBN
978-3-642-77737-0
Series ISSN
1431-2654
Edition Number
1
Number of Pages
VII, 105
Topics