@inproceedings{4596a134261d482d94fbe1902ac4c2fd,

title = "The computation of polynomial greatest common divisors over an algebraic number field",

abstract = "We present an algorithm for computing the greatest common divisor of two polynomials over an algebraic number field. We obtain a better computing time bound for this algorithm than for previously published algorithms solving the same problem. We have also performed empirical run time tests which have confirmed this. Our motivation for seeking the algorithm of the present paper stems from our interest in the cylindrical algebraic decomposition (cad) algorithm (Collins [3], Arnon et al. [1]). The cad algorithm makes essential use of algebraic polynomial gcd computations, which often dominate the cost of the algorithm. Our algorithm is a generalization of the modular algorithm developed by Brown.",

author = "Lars Langemyr and Scott McCallum",

year = "1989",

month = "1",

day = "1",

doi = "10.1007/3-540-51517-8_129",

language = "English",

isbn = "9783540515173",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-VDI-Verlag GmbH & Co. KG",

pages = "298--299",

editor = "Davenport, {James H.}",

booktitle = "Eurocal 1987 - European Conference on Computer Algebra , Proceedings",

address = "Germany",

}