Book review of: Inevitable randomness in discrete mathematics, by József Beck
From MaRDI portal
Publication:2849010
DOI10.1090/S0273-0979-2013-01407-1zbMATH Open1272.00019MaRDI QIDQ2849010FDOQ2849010
Authors: J. Maurice Rojas 
Publication date: 16 September 2013
Published in: Bulletin of the American Mathematical Society. New Series (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational Complexity
- A random polynomial-time algorithm for approximating the volume of convex bodies
- PRIMES is in P
- On sets of integers containing k elements in arithmetic progression
- Combinatorial Games
- A Fast Monte-Carlo Test for Primality
- On the Complexity of Computing the Volume of a Polyhedron
- How to compute the volume in high dimension?
- Title not available (Why is that?)
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Title not available (Why is that?)
- A quantitative ergodic theory proof of Szemerédi's theorem
- The \(\text{P}=\text{NP}\) question and Gödel's lost letter
- Primality testing and Abelian varieties over finite fields
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)
