Theory & Algos · Book
Mathematics and Computation
A Theory Revolutionizing Technology and Science
Wigderson surveys computational complexity theory, the mathematical study of efficient computation, explaining the ideas and motivations behind its key models, notions and results.
Good fit if
Turing and Abel Prize Laureate Avi Wigderson's sweeping monograph on P vs. NP, randomness, zero-knowledge proofs, and computational complexity.
About the book
He moves through algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning. A closing account treats the theory of computation's methodology and its effects on science, technology and society. Many parts require little background, and an extensive bibliography covers every topic.
Author
Readers
Where next
Connections
5Its authors, the courses that use it and the lectures that cite it.
