A correct proof of the heuristic GCD algorithm

Simple item page
dc.creatorParisse, Bernard
dc.date2002-06-21
dc.date.accessioned2026-07-07T03:18:32Z
dc.date.available2026-07-07T03:18:32Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0206032
dc.identifierhttp://arxiv.org/abs/cs/0206032
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31153
dc.subjectSymbolic Computation
dc.subjectG.4
dc.titleA correct proof of the heuristic GCD algorithm
dc.typetext

Files

Collections

arXiv