approximate GCD
Description: An approximate greatest common divisor is a polynomial or integer common divisor computed under a tolerance when inputs are nearly, but not exactly, divisible.
Primary topic: Polynomial and algebraic computation (82%)
Related topic: Polynomial and algebraic computation (82%)
OpenAlex ID: keywords/approximate-gcd
