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.

A unified approach to fast GCD algorithms for polynomials and integers : Technical report from Fachbereich Mathematik, Frie Universitaet Berlin. / Thull, Klaus; Yap, Chee.

Fundamental problems in algorithmic algebra. Oxford University Press, 2000. Chapter 2.

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

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.
@inbook{e83007496d3d4673af01550fca2938e3,
title = "A unified approach to fast GCD algorithms for polynomials and integers: Technical report from Fachbereich Mathematik, Frie Universitaet Berlin",
author = "Klaus Thull and Chee Yap",
year = "2000",
language = "English (US)",
booktitle = "Fundamental problems in algorithmic algebra",
publisher = "Oxford University Press",

}

TY - CHAP

T1 - A unified approach to fast GCD algorithms for polynomials and integers

T2 - Technical report from Fachbereich Mathematik, Frie Universitaet Berlin

AU - Thull, Klaus

AU - Yap, Chee

PY - 2000

Y1 - 2000

M3 - Chapter (peer-reviewed)

BT - Fundamental problems in algorithmic algebra

PB - Oxford University Press

ER -