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 , , | 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.

Posted in Open problems | Tagged | Leave a comment