Computation of the GCD of polynomials of several variables on a MPC
Zapiski Nauchnykh Seminarov POMI, Computational methods and automatic programming, Tome 58 (1976), pp. 148-155
Cet article a éte moissonné depuis la source Math-Net.Ru
The article is devoted to computer calculations with polynomials of several variables, in particular, to the construction of sets of large-block polynomial operations and to the concretization of the generalized algorithm of Euclid for computing the greatest common divisor (GCD) of two polynomials of several variables.
@article{ZNSL_1976_58_a15,
author = {Yu. V. Rybakova and T. N. Smirnova},
title = {Computation of the {GCD} of polynomials of several variables on a {MPC}},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {148--155},
year = {1976},
volume = {58},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1976_58_a15/}
}
Yu. V. Rybakova; T. N. Smirnova. Computation of the GCD of polynomials of several variables on a MPC. Zapiski Nauchnykh Seminarov POMI, Computational methods and automatic programming, Tome 58 (1976), pp. 148-155. http://geodesic.mathdoc.fr/item/ZNSL_1976_58_a15/