Revision history of "Finding primes with O(k) random bits"

From Polymath1Wiki
Jump to: navigation, search

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur | prev) 05:07, 3 August 2009Teorth (Talk | contribs). . (1,454 bytes) (+1,454). . (New page: We have at least two ways to find k-digit primes with probability > 1/2 (say) in polynomial time using O(k) random bits. (Note that the trivial algorithm of randomly generating k-digit num...)