Book Review: Inevitable randomness in discrete mathematics
From MaRDI portal
Publication:2849010
DOI10.1090/S0273-0979-2013-01407-1zbMath1272.00019MaRDI QIDQ2849010
Publication date: 16 September 2013
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
00A17: External book reviews
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A quantitative ergodic theory proof of Szemerédi's theorem
- Primality testing and Abelian varieties over finite fields
- How to compute the volume in high dimension?
- PRIMES is in P
- The P=NP Question and Gödel’s Lost Letter
- On the Complexity of Computing the Volume of a Polyhedron
- On sets of integers containing k elements in arithmetic progression
- A Fast Monte-Carlo Test for Primality
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Computational Complexity
- Combinatorial Games
- Derandomizing polynomial identity tests means proving circuit lower bounds