Geodesic
A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.
Numerische Mathematik, Tome 52 (1987) no. 5, pp. 119-128

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : polynomial remainder sequence, polynomial greatest common divisor, Bareiss's integer-preserving Gaussian elimination algorithm, bubble-pivot 
@article{NUMA_1987__52_5_133228,
     author = {Alkiviadis G. Akritas},
     title = {A {New} {Method} for {Computing} {Polynomial} {Greatest} {Common} {Divisors} and {Polynomial} {Remainder} {Sequences.}},
     journal = {Numerische Mathematik},
     pages = {119--128},
     publisher = {mathdoc},
     volume = {52},
     number = {5},
     year = {1987},
     zbl = {0617.68039},
     url = {http://geodesic.mathdoc.fr/item/NUMA_1987__52_5_133228/}
}
TY  - JOUR
AU  - Alkiviadis G. Akritas
TI  - A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.
JO  - Numerische Mathematik
PY  - 1987
SP  - 119
EP  - 128
VL  - 52
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/NUMA_1987__52_5_133228/
ID  - NUMA_1987__52_5_133228
ER  - 
%0 Journal Article
%A Alkiviadis G. Akritas
%T A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.
%J Numerische Mathematik
%D 1987
%P 119-128
%V 52
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/NUMA_1987__52_5_133228/
%F NUMA_1987__52_5_133228
Alkiviadis G. Akritas. A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.. Numerische Mathematik, Tome 52 (1987) no. 5, pp. 119-128. http://geodesic.mathdoc.fr/item/NUMA_1987__52_5_133228/