Book review of: Inevitable randomness in discrete mathematics, by József Beck

DOI10.1090/S0273-0979-2013-01407-1MaRDI QIDQ2849010zbMATH OpenFDO

Authors J. Maurice Rojas

Publication date 16 September 2013

Published in Bulletin of the American Mathematical Society. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

External book reviews (00A17)

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 1254302 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• A Fast Monte-Carlo Test for Primality
• A quantitative ergodic theory proof of Szemerédi's theorem
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Combinatorial Games
• Computational Complexity
• Derandomizing polynomial identity tests means proving circuit lower bounds
• How to compute the volume in high dimension?
• On sets of integers containing k elements in arithmetic progression
• On the Complexity of Computing the Volume of a Polyhedron
• PRIMES is in P
• Primality testing and Abelian varieties over finite fields
• The \(\text{P}=\text{NP}\) question and Gödel's lost letter

This page was built for publication: Book review of: Inevitable randomness in discrete mathematics, by József Beck

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849010)