000			03003 a2200241 4500
008			240520b 2019|||||||| |||| 00| 0 eng d
020			_a9780691189130 (HB)
041			_aeng
080			_a511 _bWIG
100			_aWigderson, Avi
245			_aMathematics and Computation _b: A Theory Revolutionizing Technology and Science
260			_bPrinceton University Press _c2019 _aPrinceton
300			_axiii, 418p.
504			_aIncludes References (349-418)
505			_a1. Introduction 2. Prelude: computation, undecidability, and limits to mathematical knowledge 3. Computational complexity 101: the basics, P, and NP 4. Problems and classes inside (and around) NP 5. Lower bounds, Boolean circuits, and attacks on P vs NP 6. Proof complexity 7. Randomness in computation 8. Abstract pseudo-randomness 9. Weak random sources and randomness extractors 10. Randomness and interaction in proofs 11. Quantum computing 12. Arithmetic complexity 13. Interlude: concrete interactions between math and computational complexity 14. Space complexity: modeling limited memory 15. Communication complexity: modeling information bottlenecks 16. On-line algorithms: coping with an unknown future 17. Computational learning theory, AI, and beyond 18. Cryptography: modeling secrets and lies, knowledge and trust 19. Distributed computing: coping with asynchrony 20. Epilogue: a broader perspective of ToC.
520			_aAn introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy, Mathematics and Computation provides a broad, conceptual overview of computational complexity theory--the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field's insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society.
650			_aComputational Complexity
650			_aComputer science -- Mathematics
650			_aBoolean Algebra
650			_aCryptography
690			_aGeneral
942			_cBK
999			_c60122 _d60122