To appear in the Journal of Symbolic Computation
We present several genetic algorithms for solving the extended greatest common divisor problem. After defining the problem and discussing previous work, we will state our results.
Archived with permission. The author(s) reserves all rights.
V. Piehl, J. Sorenson, and N. Tiedeman, Genetic algorithms for the extended GCD problem, to appear in the Journal of Symbolic Computation. Posters presented at ISSAC’97 and the 1997 CUR Poster Session on Capitol Hill.