New Characterization of the Factor Refinement Algorithm with Applications
Open Access
- 24 July 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 490-497
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A deterministic version of Pollard’s $p-1$ algorithmMathematics of Computation, 2010
- Detecting perfect powers by factoring into coprimesMathematics of Computation, 2006
- Factoring into coprimes in essentially linear timeJournal of Algorithms, 2005
- On factor refinement in number fieldsMathematics of Computation, 1999
- Computing Hermite and Smith normal forms of triangular integer matricesLinear Algebra and its Applications, 1998
- Factor RefinementJournal of Algorithms, 1993
- Some remarks on computing the square parts of integersInformation and Computation, 1988
- Reductions among number theoretic problemsInformation and Computation, 1987
- Number-theoretic functions which are equivalent to number of divisorsInformation Processing Letters, 1985
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976