Sieve algorithms for perfect power testing
- 1 April 1993
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 9 (4) , 313-328
- https://doi.org/10.1007/bf01228507
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Factoring with cyclotomic polynomialsMathematics of Computation, 1989
- How to Generate Factored Random NumbersSIAM Journal on Computing, 1988
- Sums of Divisors, Perfect Numbers and FactoringSIAM Journal on Computing, 1986
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- Almost all primes can be quickly certifiedPublished by Association for Computing Machinery (ACM) ,1986
- Asymptotically fast factorization of integersMathematics of Computation, 1981
- Multiplicative Number TheoryPublished by Springer Nature ,1980
- MULTIPLE-PRECISION ZERO-FINDING METHODS AND THE COMPLEXITY OF ELEMENTARY FUNCTION EVALUATIONPublished by Elsevier ,1976
- A new arithmetic function of combinatorial significanceJournal of Number Theory, 1973
- The recognition problem for the set of perfect squaresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1966