Factoring into coprimes in essentially linear time
- 31 January 2005
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 54 (1) , 1-30
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Prime Power Graphs for Groups of Lie TypeJournal of Algebra, 2002
- On factor refinement in number fieldsMathematics of Computation, 1999
- Subquadratic-time factoring of polynomials over finite fieldsMathematics of Computation, 1998
- Detecting perfect powers in essentially linear timeMathematics of Computation, 1998
- Recognizing units in number fieldsMathematics of Computation, 1994
- Approximatting rings of integers in number fieldsJournal de Théorie des Nombres de Bordeaux, 1994
- Factor RefinementJournal of Algorithms, 1993
- Sums of Divisors, Perfect Numbers and FactoringSIAM Journal on Computing, 1986
- Representations and Parallel Computations for Rational FunctionsSIAM Journal on Computing, 1986
- Quantifier elimination for real closed fields by cylindrical algebraic decomposition--preliminary reportACM SIGSAM Bulletin, 1974