Can I read GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation on EtoBox?

GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation by Bruce W. Char; Keith O. Geddes; Gaston H. Gonnet is a Computer Science article available to read on EtoBox.

What is GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation about?

A heuristic algorithm, GCDHEU, is described for polynomial GCD computation over the integers. The algorithm is based on evaluation at a single large integer value (for each variable), integer GCD computation, and a single-point interpolation scheme. Timing comparisons show that this algorithm is very efficient for most univariate problems and it is also the algorithm of choice for many problems in up to four variables.

Who reads GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation?

Author

Bruce W. Char; Keith O. Geddes; Gaston H. Gonnet

Publisher

Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0747-7171)

Published

1989

Language

EN

Field

Computer Science (Physical Sciences)