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: Specifying SystemsSpecifying Systems
by - Addison-Wesley Professional
This book shows how to write unambiguous specifications of complex computer systems. It provides a complete reference manual for the TLA+, the language developed by the author for writing simple and elegant specifications of algorithms and protocols.
(9071 views)
Book cover: From Complexity to CreativityFrom Complexity to Creativity
by - Plenum Press
This text applies the concepts of complexity science to provide an explanation of all aspects of human creativity. The book describes the model that integrates ideas from computer science, mathematics, neurobiology, philosophy, and psychology.
(9916 views)
Book cover: Solving NP-Complete ProblemsSolving NP-Complete Problems
by - University of Kentucky
This is an on-line textbook on heuristic algorithms. From the table of contents: Classes of Problems; Integer Programming; Enumeration Techniques; Dynamic Programming; Approximate Solutions; Local Optimization; Natural Models.
(4674 views)
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.
(11179 views)