Computer Algebra: Past and Future
- 30 September 1986
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 2 (3) , 217-236
- https://doi.org/10.1016/s0747-7171(86)80025-6
Abstract
No abstract availableKeywords
This publication has 90 references indexed in Scilit:
- Cylindrical Algebraic Decomposition I: The Basic AlgorithmSIAM Journal on Computing, 1984
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- The Subresultant PRS AlgorithmACM Transactions on Mathematical Software, 1978
- A theoretical basis for the reduction of polynomials to canonical formsACM SIGSAM Bulletin, 1976
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- On Schanuel's ConjecturesAnnals of Mathematics, 1971
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970
- Factoring Polynomials Over Finite FieldsBell System Technical Journal, 1967
- The ALPAK System for Nonnumerical Algebra on a Digital Computer - II: Rational Functions of Several Variables and Truncated Power Series with Rational-Function CoefficientsBell System Technical Journal, 1964