Computability and Complexity
Publisher: Wikibooks 2010
Description:
This book is intended as an introductory textbook in Computability Theory and Complexity Theory, with an emphasis on Formal Languages. Its target audience is Computer Science and Math students with some background in programming, data structures, and discrete math, such as a sophomore in a Computer Science program.
Download or read it online for free here:
Read online
(online html)
Similar books
![Book cover: Computational Complexity: A Conceptual Perspective](images/3598.jpg)
by Oded Goldreich - Cambridge University Press
This book offers a comprehensive perspective to modern topics in complexity theory. It can be used as an introduction as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory.
(12112 views)
![Book cover: Foundations of Cryptography](images/3660.jpg)
by Oded Goldreich - Cambridge University Press
The book gives the mathematical underpinnings for cryptography; this includes one-way functions, pseudorandom generators, and zero-knowledge proofs. Throughout, definitions are complete and detailed; proofs are rigorous and given in full.
(17016 views)
![Book cover: Lecture Notes on Computational Complexity](images/blank.gif)
by Luca Trevisan
Notes from a graduate courses on Computational Complexity. The first 15 lectures cover fundamentals, the remaining is advanced material: Hastad's optimal inapproximability results, lower bounds for parity in bounded depth-circuits, and more.
(15278 views)
![Book cover: Introduction to Complexity Theory](images/blank.gif)
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.
(10969 views)