Seeking better algorithms for approximate GCD

DOI10.1145/3096730.3096733zbMath1433.68627OpenAlexW2615632187MaRDI QIDQ4630097

Kosaku Nagasaka

Publication date: 29 March 2019

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3096730.3096733

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Computational methods for problems pertaining to field theory (12-08)

Related Items (1)

Approximate square-free part and decomposition

This page was built for publication: Seeking better algorithms for approximate GCD