Hacker Times
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
evandijk70
on Dec 21, 2011
|
parent
|
context
|
favorite
| on:
The Lehmann primality test.
Elliptic Curve Primality Proving is way faster in practice, and although it's running time is not deterministic, it does give a proof that a number is prime.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: