Irreducible polynomials with integral coefficients have succinct certificates
- 1 December 1981
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 2 (4) , 385-392
- https://doi.org/10.1016/0196-6774(81)90036-5
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- Every Prime Has a Succinct CertificateSIAM Journal on Computing, 1975