A correct proof of the heuristic GCD algorithm

Computer Science – Symbolic Computation

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A correct proof of the heuristic GCD algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A correct proof of the heuristic GCD algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A correct proof of the heuristic GCD algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-255744

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.