Logo

Algorithmic Randomness and Complexity

Large book cover: Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity
by

Publisher: Springer
ISBN/ASIN: 0387955674
ISBN-13: 9780387955674
Number of pages: 629

Description:
Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of algorithmic randomness and complexity for scientists from diverse fields.

Home page url

Download or read it online for free here:
Download link
(4MB, PDF)

Similar books

Book cover: Complexity TheoryComplexity Theory
by
This set of notes gives the broad picture of modern complexity theory, defines the basic complexity classes, gives some examples of each complexity class and proves the most standard relations. The author emphasizes the ideas involved in the proofs.
(13549 views)
Book cover: Introduction to Complexity TheoryIntroduction to Complexity Theory
by
Complexity theory is the study of the intrinsic complexity of computational tasks. The book is aimed at exposing the students to the basic results and research directions in the field. The focus was on concepts, complex technical proofs were avoided.
(8281 views)
Book cover: Measure-Preserving SystemsMeasure-Preserving Systems
by - University of North Carolina
These notes provide an introduction to the subject of measure-preserving dynamical systems, discussing the dynamical viewpoint; how and from where measure-preserving systems arise; the construction of measures and invariant measures; etc.
(8549 views)
Book cover: P, NP, and NP-Completeness: The Basics of Complexity TheoryP, NP, and NP-Completeness: The Basics of Complexity Theory
by - Cambridge University Press
The main focus of the current book is on the P-vs-NP Question and the theory of NP-completeness. Additional topics that are covered include the treatment of the general notion of a reduction between computational problems.
(7103 views)