A correct proof of the heuristic GCD algorithm
Bernard Parisse
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.
Create a lesson
Related papers
Exact rational certificates and a Lean formalization of the eleven-variable Vasc inequality
Dakai Guo, Ruichen Qiu, Yichuan Cao et al.
RISR: Residual-Informed Scientific Equation Discovery with Large Language Models
Haobo Li, Wenshuo Zhang, Wenxiao Zhao et al.
A Finite Certificate for the Positive n=11 Vasc Inequality
Tiancheng Xu, Wensheng Yu
Parallel Integration over Simple Radical Extensions III: Antiderivatives in Terms of Special Functions
Sam Blake
Root isolation for analytic functions using cubic hermite interpolation
Christophe Raffalli
CPUNeSy: Controlling Model Writes for Reliable Neuro-Symbolic Reasoning
Zeyan Li, Siyuan Qiu, Shuai Zhao et al.