A correct proof of the heuristic GCD algorithm
classification
💻 cs.SC
keywords
heuristicproofadditionnalalgorithmcasecharcorrectfill
read the original abstract
In this note, we fill a gap in the proof of the heuristic GCD in the multivariate case made by Char, Geddes and Gonnet (JSC 1989) and give some additionnal information on this method.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.