Tag Archives: derandomization

Four Derandomization Problems

Posted on December 6, 2009 by

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