Irreducibility testing and factorization of polynomials
- 1 October 1981
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 409-418
- https://doi.org/10.1109/sfcs.1981.20
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Irreducible polynomials with integral coefficients have succinct certificatesJournal of Algorithms, 1981
- Asymptotically fast factorization of integersMathematics of Computation, 1981
- On distinguishing prime numbers from composite numbersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- On the Efficiency of a Polynomial Irreducibility TestJournal of the ACM, 1978
- On the efficiency of algorithms for polynomial factoringMathematics of Computation, 1977
- A Method of Factoring and the Factorization of F 7Mathematics of Computation, 1975
- Riemann's Hypothesis and tests for primalityPublished by Association for Computing Machinery (ACM) ,1975
- Primes represented by irreducible polynomials in one variablePublished by American Mathematical Society (AMS) ,1965
- On maximal gaps between successive primesMathematics of Computation, 1964
- A heuristic asymptotic formula concerning the distribution of prime numbersMathematics of Computation, 1962