References
- 1
-
D.H. Bailey.
Multiprecision translation and execution of FORTRAN programs.
ACM Trans. on Math. Soft.,
19(3):288-319, 1993.
- 2
-
B. Buchberger, G.E. Collins, and R. Loos, editors.
Computer Algebra: Symbolic and Algebraic Computation.
Springer-Verlag, Wien, 2nd edition, 1982.
- 3
-
G.E. Collins, M. Mignotte, and F. Winkler.
Arithmetic in basic algebraic domains.
In B. Buchberger, G.E. Collins, and R. Loos, editors, Computer
Algebra: Symbolic and Algebraic Computation, pages 189-220.
Springer-Verlag, Wien, 2nd edition, 1982.
- 4
-
D. Cox, J. Little, and D. O'Shea.
Using Algebraic Geometry.
Springer, New York, 1997.
To appear.
- 5
-
I.Z. Emiris and A. Galligo.
Review of Polynomial and Matrix Computations. Volume 1:
Fundamental Algorithms, by D. Bini and V. Pan, Birkhäuser,
Boston, 1994.
SIGSAM Bulletin, 1996.
- 6
-
J.-C. Faugère, 1997.
Personal Communication.
- 7
-
L. Gonzalez-Vega, H. Lombardi, T. Recio, and M.-F. Roy.
Determinants and real roots of univariate polynomials.
In Proc. 25 Years of Quantifier Elimination and Cylindrical
Algebraic Decomposition, Linz, Oct. 1993, Texts and Monographs in Symbolic
Computation. Springer, 1995.
- 8
-
E. Kaltofen and Y. Lakshman.
Improved sparse multivariate polynomial interpolation algorithms.
In Proc. ACM Intern. Symp. on Symbolic and Algebraic
Computation, volume 358 of Lect. Notes in Comp. Science, pages
467-474. Springer-Verlag, 1988.
- 9
-
D. Kapur and Y.N. Lakshman.
Elimination methods: An introduction.
In B. Donald, D. Kapur, and J. Mundy, editors, Symbolic and
Numerical Computation for Artificial Intelligence, pages 45-89. Academic
Press, 1992.
- 10
-
R. Loos.
Generalized polynomial remainder sequences.
In B. Buchberger, G.E. Collins, and R. Loos, editors, Computer
Algebra: Symbolic and Algebraic Computation, pages 115-137.
Springer-Verlag, Wien, 2nd edition, 1982.
- 11
-
V.Y. Pan, 1996.
Personal Communication.
- 12
-
V.Y. Pan.
Parallel computation of polynomial GCD and some related parallel
computations over abstract fields.
Theor. Comp. Science, 162(2):173-223, 1996.
- 13
-
Chee K. Yap.
Fundamental Problems in Algorithmic Algebra.
Princeton University Press, Princeton, 1997.
To appear.
- 14
-
R. Zippel.
Effective Polynomial Computation.
Kluwer Academic Publishers, Boston, 1993.
Conclusion
Contents of the Review