Mathematics and Computation

Regular price €55.99
Regular price €56.99 Sale Sale price €55.99
A01=Avi Wigderson
Age Group_Uncategorized
Age Group_Uncategorized
Algorithm
Approximation algorithm
Author_Avi Wigderson
automatic-update
Best
Boolean circuit
Boolean function
BQP
Brute-force search
Category1=Non-Fiction
Category=PB
Category=UYA
Circuit complexity
Communication complexity
Commutative property
Complexity class
Computation
Computational complexity theory
Computational indistinguishability
Computational model
Computational problem
Computational resource
Conjecture
COP=United States
Cryptography
Decision problem
Delivery_Delivery within 10-20 working days
Density matrix renormalization group
Deterministic algorithm
eq_computing
eq_isMigrated=2
eq_non-fiction
Geometric complexity theory
Hardness
Hilbert's program
Instance (computer science)
Karush–Kuhn–Tucker conditions
Language_English
Linear programming
Mathematics
Metaheuristic
Natural proof
NP-completeness
NP-hardness
One-way function
Online algorithm
Open problem
Optimization problem
P versus NP problem
PA=Available
Parameter (computer programming)
PCP theorem
Pigeonhole principle
Polynomial
PP (complexity)
Price_€50 to €100
Probabilistic method
Probability
Proof complexity
PS=Active
Pseudorandom generator
Pseudorandomness
PSPACE-complete
Public-key cryptography
Quantum algorithm
Quantum computing
Randomized algorithm
Randomness
Result
Roth's theorem
Sample complexity
Search problem
Semidefinite programming
softlaunch
Special case
Subset
Theorem
Theory of computation
Time complexity
Turing machine
Turing test
Variable (mathematics)
VC dimension
Weighted Majority Algorithm
With high probability
worst and average case

Product details

  • ISBN 9780691189130
  • Dimensions: 178 x 254mm
  • Publication Date: 29 Oct 2019
  • Publisher: Princeton University Press
  • Publication City/Country: US
  • Product Form: Hardback
  • Language: English
Delivery/Collection within 10-20 working days

Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock

10-20 Working Days: On Backorder

Will Deliver When Available: On Pre-Order or Reprinting

We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!

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
Avi Wigderson is the Herbert H. Maass Professor in the School of Mathematics at the Institute for Advanced Study in Princeton. He is a recipient of the Turing Award, the highest distinction in computer science, and the Abel Prize, widely considered to be the highest recognition of impact in mathematics.