img Leseprobe Leseprobe

Mathematics and Computation

A Theory Revolutionizing Technology and Science

Avi Wigderson

PDF
ca. 57,99
Amazon iTunes Thalia.de Weltbild.de Hugendubel Bücher.de ebook.de kobo Osiander Google Books Barnes&Noble bol.com Legimi yourbook.shop Kulturkaufhaus ebooks-center.de
* Affiliatelinks/Werbelinks
Hinweis: 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.

Princeton University Press img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Mathematik

Beschreibung

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

Weitere Titel in dieser Kategorie
Cover Quantum Leaps
Hugh Barker
Cover Polyadic Groups
Wieslaw A. Dudek
Cover Polyadic Groups
Wieslaw A. Dudek

Kundenbewertungen

Schlagwörter

Approximation algorithm, Computation, Quantum algorithm, NP-completeness, Mathematics, Commutative property, Karush–Kuhn–Tucker conditions, PSPACE-complete, Natural proof, Probability, Boolean function, Algorithm, Time complexity, Computational complexity theory, Boolean circuit, Probabilistic method, Sample complexity, BQP, Parameter (computer programming), Randomness, Density matrix renormalization group, Roth's theorem, Turing machine, Pseudorandom generator, Communication complexity, PCP theorem, Hardness, One-way function, Hilbert's program, Deterministic algorithm, With high probability, Complexity class, Geometric complexity theory, Brute-force search, Search problem, Turing test, Pigeonhole principle, Semidefinite programming, Instance (computer science), Public-key cryptography, NP-hardness, Conjecture, Cryptography, Special case, Theorem, Polynomial, Computational problem, Open problem, Pseudorandomness, Quantum computing, Variable (mathematics), PP (complexity), Metaheuristic, Theory of computation, Linear programming, Subset, VC dimension, Optimization problem, Computational indistinguishability, Computational model, Circuit complexity, Proof complexity, Online algorithm, Randomized algorithm, P versus NP problem, Computational resource, Best, worst and average case, Result, Decision problem, Weighted Majority Algorithm