Leseprobe
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Mathematics and Computation
Avi Wigderson
* Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.
Naturwissenschaften, Medizin, Informatik, Technik / Mathematik
Beschreibung
From the winner of the Turing Award and the Abel Prize, 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. For further reading, an extensive bibliography is provided for all topics covered.
Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation.
- Comprehensive coverage of computational complexity theory, and beyond
- High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline
- Historical accounts of the evolution and motivations of central concepts and models
- A broad view of the theory of computation's influence on science, technology, and society
- Extensive bibliography
Kundenbewertungen
NP-completeness, Quantum algorithm, Computational indistinguishability, Computational complexity theory, BQP, Commutative property, P versus NP problem, Result, Variable (mathematics), Theorem, Boolean circuit, Hilbert's program, Public-key cryptography, Density matrix renormalization group, Special case, Computational resource, Conjecture, Complexity class, Randomness, Sample complexity, Mathematics, Instance (computer science), Proof complexity, Search problem, With high probability, PSPACE-complete, Roth's theorem, Natural proof, Algorithm, Decision problem, Metaheuristic, Open problem, Computation, Polynomial, Probabilistic method, VC dimension, NP-hardness, One-way function, Turing machine, Theory of computation, Boolean function, Circuit complexity, Weighted Majority Algorithm, Hardness, Deterministic algorithm, Randomized algorithm, Approximation algorithm, Best, worst and average case, Optimization problem, Pseudorandom generator, Communication complexity, Pigeonhole principle, Subset, Parameter (computer programming), Cryptography, Linear programming, Probability, Quantum computing, Turing test, Pseudorandomness, Computational problem, Online algorithm, PP (complexity), Karush–Kuhn–Tucker conditions, Semidefinite programming, Time complexity, PCP theorem, Computational model, Brute-force search, Geometric complexity theory