openproblem.space·the wiki Sign in to edit
Difference between revisions

primes-in-p

Revision 62 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/02-computation.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”
Revision 62 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/02-computation.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”

Source +0 −0

Revision 62 as rendered

Randomized tests had been fast for decades, but no deterministic polynomial-time test was known. AKS found one using elementary algebra, and two of the three authors were undergraduates. In practice randomized tests are still used; the result settled the question of principle.

Evidence tier V3 is the import default for a result the curation records as settled in the published record. No formal proof or certificate is attached to this page yet.

Closed 2002, Manindra Agrawal, Neeraj Kayal and Nitin Saxena.

Sources

Complexity classes · Computation