Mathematics and Computation (eBook)

A Theory Revolutionizing Technology and Science

(Autor)

eBook Download: PDF
2019
440 Seiten
Princeton University Press (Verlag)
978-0-691-19254-3 (ISBN)

Lese- und Medienproben

Mathematics and Computation - Avi Wigderson
Systemvoraussetzungen
57,99 inkl. MwSt
  • Download sofort lieferbar
  • Zahlungsarten anzeigen
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 philosophyMathematics and Computation provides a broad, conceptual overview of computational complexity theorythe 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 beyondHigh-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific disciplineHistorical accounts of the evolution and motivations of central concepts and modelsA broad view of the theory of computation's influence on science, technology, and societyExtensive bibliography

Avi Wigderson is the Herbert H. Maass Professor in the School of Mathematics at the Institute for Advanced Study in Princeton, New Jersey.

Erscheint lt. Verlag 29.10.2019
Zusatzinfo 25 b/w illus.
Verlagsort Princeton
Sprache englisch
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik
Schlagworte algorithm • approximation algorithm • Auxiliary function • Best, worst and average case • Binary search algorithm • Boolean circuit • boolean function • Boosting (machine learning) • BQP • Brute-force search • byzantine fault tolerance • C0 • central limit theorem • circuit complexity • communication complexity • commutative property • Complexity class • Computation • computational complexity theory • Computational indistinguishability • Computational Model • Computational problem • Computational resource • conjecture • Cryptographic primitive • cryptography • Decision problem • Density matrix renormalization group • Deterministic algorithm • Disjunctive normal form • Ellipsoid Method • Entscheidungsproblem • Geometric complexity theory • Gödel's Incompleteness Theorems • Hardness • hardness of approximation • Hilbert's program • Information Theory • Instance (computer science) • Karush–Kuhn–Tucker conditions • Law of small numbers • Learning with errors • Linear Programming • logical framework • Matching (graph theory) • Mathematical Optimization • Mathematics • Metaheuristic • Natural proof • np-completeness • NP (complexity) • NP-hardness • one-way function • online algorithm • Open problem • optimization problem • Parameter (computer programming) • PCP theorem • pigeonhole principle • polynomial • PP (complexity) • Probabilistic method • Probability • proof complexity • pseudorandom generator • Pseudorandomness • Pseudorandom number generator • pspace • PSPACE-complete • Public-Key Cryptography • P versus NP problem • Quadratic residue • quantum algorithm • Quantum Computing • Random element • randomized algorithm • randomness • result • Roth's theorem • sample complexity • Sanjeev Arora • scientific notation • Search problem • semidefinite programming • Simplex Algorithm • Special case • Subset • Theorem • Theory of Computation • time complexity • Turing Machine • turing test • Universal property • Upper and lower bounds • Variable (mathematics) • VC dimension • Weighted Majority Algorithm • With high probability • Zermelo–Fraenkel set theory • zero-knowledge proof
ISBN-10 0-691-19254-5 / 0691192545
ISBN-13 978-0-691-19254-3 / 9780691192543
Haben Sie eine Frage zum Produkt?
PDFPDF (Adobe DRM)

Kopierschutz: Adobe-DRM
Adobe-DRM ist ein Kopierschutz, der das eBook vor Mißbrauch schützen soll. Dabei wird das eBook bereits beim Download auf Ihre persönliche Adobe-ID autorisiert. Lesen können Sie das eBook dann nur auf den Geräten, welche ebenfalls auf Ihre Adobe-ID registriert sind.
Details zum Adobe-DRM

Dateiformat: PDF (Portable Document Format)
Mit einem festen Seiten­layout eignet sich die PDF besonders für Fach­bücher mit Spalten, Tabellen und Abbild­ungen. Eine PDF kann auf fast allen Geräten ange­zeigt werden, ist aber für kleine Displays (Smart­phone, eReader) nur einge­schränkt geeignet.

Systemvoraussetzungen:
PC/Mac: Mit einem PC oder Mac können Sie dieses eBook lesen. Sie benötigen eine Adobe-ID und die Software Adobe Digital Editions (kostenlos). Von der Benutzung der OverDrive Media Console raten wir Ihnen ab. Erfahrungsgemäß treten hier gehäuft Probleme mit dem Adobe DRM auf.
eReader: Dieses eBook kann mit (fast) allen eBook-Readern gelesen werden. Mit dem amazon-Kindle ist es aber nicht kompatibel.
Smartphone/Tablet: Egal ob Apple oder Android, dieses eBook können Sie lesen. Sie benötigen eine Adobe-ID sowie eine kostenlose App.
Geräteliste und zusätzliche Hinweise

Buying eBooks from abroad
For tax law reasons we can sell eBooks just within Germany and Switzerland. Regrettably we cannot fulfill eBook-orders from other countries.

Mehr entdecken
aus dem Bereich
Discover tactics to decrease churn and expand revenue

von Jeff Mar; Peter Armaly

eBook Download (2024)
Packt Publishing (Verlag)
25,19