« Metanews | Main | Chimera .6 »
November 04, 2002
Cut down in the prime of polynomial time
This team has discovered a polynomial-time algorithm to determine the prime or composite status of a given integer. You can download the descriptive paper, which is only 9 pages long (if a tad dense).
Spotted at Metafilter.
November 4, 2002 in Seen browsing | Permalink
TrackBack
TrackBack URL for this entry:
https://www.typepad.com/services/trackback/6a00d8341bf6df53ef00d83502c14353ef
Listed below are links to weblogs that reference Cut down in the prime of polynomial time: