European University Institute Library

Mathematics and computation:, a theory revolutionizing technology and science, Avi Wigderson

eng

Includes bibliographical references (pages 349-418)

illustrations

no index present

non fiction

Mathematics and computation:

bibliography

1051136440

Avi Wigderson

a theory revolutionizing technology and science

"An 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."--, Provided by publisher

Introduction -- Prelude: computation, undecidability, and limits to mathematical knowledge -- Computational complexity 101: the basics, P, and NP -- Problems and classes inside (and around) NP -- Lower bounds, Boolean circuits, and attacks on P vs NP -- Proof complexity -- Randomness in computation -- Abstract pseudo-randomness -- Weak random sources and randomness extractors -- Randomness and interaction in proofs -- Quantum computing -- Arithmetic complexity -- Interlude: concrete interactions between math and computational complexity -- Space complexity: modeling limited memory -- Communication complexity: modeling information bottlenecks -- On-line algorithms: coping with an unknown future -- Computational learning theory, AI, and beyond -- Cryptography: modeling secrets and lies, knowledge and trust -- Distributed computing: coping with asynchrony -- Epilogue: a broader perspective of ToC