Recent Comments
Peter W. Shor on Why is Mathematics Possible: T… Jon Awbrey on Why is Mathematics Possible: T… Peter W. Shor on Why is Mathematics Possible: T… Why is Mathematics P… on Why is mathematics possib… Reshef on Why is mathematics possib… Reshef on Why is mathematics possib… gowers on Why is mathematics possib… Peter Shor on A Few Slides and a Few Comment… Gil Kalai on A Few Slides and a Few Comment… Peter W. Shor on A Few Slides and a Few Comment… Peter W. Shor on A Few Slides and a Few Comment… Peter W. Shor on A Few Slides and a Few Comment…
Tag Archives: polymath4
Four Derandomization Problems
Polymath4 is devoted to a question about derandomization: To find a deterministic polynomial time algorithm for finding a k-digit prime. So I (belatedly) devote this post to derandomization and, in particular, the following four problems. 1) Find a deterministic algorithm for primality 2) Find … Continue reading
Posted in Computer Science and Optimization, Probability
Tagged derandomization, polymath4, Randomness
4 Comments
Polymath4 – Finding Primes Deterministically – is On Its Way
After two long and interesting discussion threads polymath4, devoted to finding deterministically large prime numbers, is on its way on the polymath blog.
