A modular GCD algorithm over number fields presented with multiple extensions

Mark van Hoeij, Michael B. Monagan. A modular GCD algorithm over number fields presented with multiple extensions. In Teo Mora, editor, Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings. pages 109-116, ACM, 2002. [doi]

@inproceedings{HoeijM02,
  title = {A modular GCD algorithm over number fields presented with multiple extensions},
  author = {Mark van Hoeij and Michael B. Monagan},
  year = {2002},
  doi = {10.1145/780506.780520},
  url = {http://doi.acm.org/10.1145/780506.780520},
  researchr = {https://researchr.org/publication/HoeijM02},
  cites = {0},
  citedby = {0},
  pages = {109-116},
  booktitle = {Symbolic and Algebraic Computation, International Symposium ISSAC 2002, Lille, France, July 7-10, 2002, Proceedings},
  editor = {Teo Mora},
  publisher = {ACM},
  isbn = {1-58113-484-3},
}