Publication | Open Access
PRIMES is in P
908
Citations
19
References
2004
Year
Theory Of ComputingComputational Complexity TheoryEngineeringComputational Number TheoryVerificationFormal MethodsAnalytic Number TheoryComputational ComplexityTime ComplexityInput NumberComputer ScienceP Versus Np ProblemDiophantine AnalysisFormal Verification
We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite.
| Year | Citations | |
|---|---|---|
Page 1
Page 1