Every Prime Has a Succinct Certificate
- 1 September 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 4 (3), 214-220
- https://doi.org/10.1137/0204018
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- Factoring Polynomials Over Finite FieldsBell System Technical Journal, 1967
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Tests for primality by the converse of Fermat’s theoremBulletin of the American Mathematical Society, 1927