New Characterization of the Factor Refinement Algorithm with Applications
From MaRDI portal
Publication:6081973
DOI10.1145/3597066.3597108OpenAlexW4383221822MaRDI QIDQ6081973
Aditya Narayan Ravi, Ilya Volkovich
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3597066.3597108
integer factorizationarithmetic functionsnumber theoretic functionssquare-free decompositionfactor refinementGCD-free bases
Cites Work
- Number-theoretic functions which are equivalent to number of divisors
- Reductions among number theoretic problems
- Some remarks on computing the square parts of integers
- Riemann's hypothesis and tests for primality
- Computing Hermite and Smith normal forms of triangular integer matrices
- Factor Refinement
- Detecting perfect powers by factoring into coprimes
- A deterministic version of Pollard’s $p-1$ algorithm
- Sums of Divisors, Perfect Numbers and Factoring
- On factor refinement in number fields
- Factoring into coprimes in essentially linear time
- The Power of Leibniz-Like Functions as Oracles
- Deterministic factoring with oracles
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
