**Complexity and Computation**

by Allen Downey

**Publisher**: Green Tea Press 2011**Number of pages**: 104

**Description**:

This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science. This book picks up where Think Python leaves off. I assume that you have read that book or have equivalent knowledge of Python.

Download or read it online for free here:

**Download link**

(1.34MB, PDF)

## Similar books

**Introduction to Complexity Theory**

by

**Oded Goldreich**

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.

(

**9806**views)

**Around Kolmogorov Complexity: Basic Notions and Results**

by

**Alexander Shen**-

**arXiv.org**

Algorithmic information theory studies description complexity and randomness. This text covers the basic notions of algorithmic information theory: Kolmogorov complexity, Solomonoff universal a priori probability, effective Hausdorff dimension, etc.

(

**5281**views)

**Introduction to Computational Complexity**

by

**Martin Tompa**

Lecture notes for a graduate course on computational complexity taught at the University of Washington. Alternating Turing machines are introduced very early, and deterministic and nondeterministic Turing machines treated as special cases.

(

**8764**views)

**Mathematics and Computation**

by

**Avi Wigderson**-

**Princeton University Press**

The book provides a broad, conceptual overview of computational complexity theory -- the mathematical study of efficient computation. It is useful for undergraduate and graduate students in mathematics, computer science, and related fields.

(

**1768**views)