A unified approach to fast GCD algorithms for polynomials and integers: Technical report from Fachbereich Mathematik, Frie Universitaet Berlin

Klaus Thull, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)

Original languageEnglish (US)
Title of host publicationFundamental problems in algorithmic algebra
PublisherOxford University Press
StatePublished - 2000

Cite this

Thull, K., & Yap, C. (2000). A unified approach to fast GCD algorithms for polynomials and integers: Technical report from Fachbereich Mathematik, Frie Universitaet Berlin. In Fundamental problems in algorithmic algebra [Chapter 2] Oxford University Press.