Factor Refinement

DOI10.1006/JAGM.1993.1038MaRDI QIDQ3141529zbMATH OpenOpenAlexFDO

Authors Eric Bach, James R. Driscoll, Jeffrey Shallit

Publication date 4 April 1994

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1993.1038

zbMATH Keywords

complexityfactor refinement

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• On component factors
• scientific article; zbMATH DE number 3749093
• Factorization
• New Characterization of the Factor Refinement Algorithm with Applications
• scientific article; zbMATH DE number 17387
• scientific article; zbMATH DE number 3105437
• Remarks on component factors

Cited in

(24)

• On factor refinement in number fields
• Testing set proportionality and the Ádám isomorphism of circulant graphs
• New Characterization of the Factor Refinement Algorithm with Applications
• Recognizing Units in Number Fields
• A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing
• Topics in computational algebraic number theory
• Computing ray class groups, conductors and discriminants
• Efficient Gröbner bases computation over principal ideal rings
• On testing for zero polynomials by a set of points with bounded precision.
• Approximating rings of integers in number fields
• Some results on uniform arithmetic circuit complexity
• Detecting perfect powers by factoring into coprimes
• Revisiting Targeted Factors
• The Power of Leibniz-Like Functions as Oracles
• Computing rational forms of integer matrices
• Computing Hermite and Smith normal forms of triangular integer matrices
• Identity testing for radical expressions
• Computing linear relations between polynomial roots
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
• Prime power graphs for groups of Lie type
• Widom factors
• Generators and irreducible polynomials over finite fields
• The average-case complexity of counting cliques in Erdős-Rényi hypergraphs
• Deterministic factoring with oracles

This page was built for publication: Factor Refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3141529)