Factor Refinement
From MaRDI portal
Publication:3141529
DOI10.1006/jagm.1993.1038zbMath0784.11058OpenAlexW2914507133MaRDI QIDQ3141529
Eric Bach, Jeffrey O. Shallit, James R. Driscoll
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
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)
Related Items
The Power of Leibniz-Like Functions as Oracles, Prime power graphs for groups of Lie type, Some results on uniform arithmetic circuit complexity, A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing, New Characterization of the Factor Refinement Algorithm with Applications, Deterministic factoring with oracles, On testing for zero polynomials by a set of points with bounded precision., Generators and irreducible polynomials over finite fields, Efficient Gröbner bases computation over principal ideal rings, Testing set proportionality and the Ádám isomorphism of circulant graphs, The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs, Computing ray class groups, conductors and discriminants, Recognizing Units in Number Fields, Topics in computational algebraic number theory, Approximating rings of integers in number fields, Computing Hermite and Smith normal forms of triangular integer matrices, Detecting perfect powers by factoring into coprimes, On factor refinement in number fields, Computing rational forms of integer matrices
