Computer algebra: Past and future
From MaRDI portal
Publication:1098287
DOI10.1016/S0747-7171(86)80025-6zbMath0636.68033MaRDI QIDQ1098287
Publication date: 1986
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
differential equationscomputer algebra systemsintegrationsummationgcdopen problemseducationreal closed fieldsalgebraic ideal theorydecision procedures for logical theoriesdevelopment in computer algebra in the period from 1966 to 1985factorization of multivariate polynomialsfuture software developmentMacsymamu-Mathparallel algorithms and architecturesReduceSAC/ALDESsymbolic roots of polynomials
Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (3)
Facilitating the Calculation of the Efficient Score Using Symbolic Computing ⋮ Using Fourier series to analyse mass imperfections in vibratory gyroscopes ⋮ Processing polynomial algebraic problems by using SAC-2/ALDES
Uses Software
Cites Work
- EUROCAL '85. European Conference on Computer Algebra, Linz, Austria, April 1-3, 1985. Proceedings. Vol. 2: Research contributions
- An algorithm for determining polynomial first integrals of autonomous systems of ordinary differential equations
- Theory of summation in finite terms
- Integration in finite terms with special functions: the error function
- An algorithm for solving second order linear homogeneous differential equations
- Résolution des systèmes d'équations algébriques
- On the integration of algebraic functions
- Factoring polynomials with rational coefficients
- On Liouville's theory of elementary functions
- Explicit evaluation of certain definite integrals involving powers of logarithms
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Analytic computation of some integrals in fourth order quantum electrodynamics
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- On Schanuel's conjectures
- Resolution of singularities of an algebraic variety over a field of characteristic zero. I
- A new decision method for elementary algebra
- Elementary First Integrals of Differential Equations
- Parallel Algorithms for Algebraic Problems
- A Generalized Class of Polynomials that are Hard to Factor
- Solving Homogeneous Linear Differential Equations in Terms of Second Order Linear Differential Equations
- Factoring Polynomials over Algebraic Number Fields
- Algorithm 628
- An Extension of Liouville’s Theorem on Integration in Finite Terms
- Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
- Integration in Finite Terms with Special Functions: The Logarithmic Integral
- A Structure Theorem for Exponential and Primitive Functions
- Algebraic Properties of the Elementary Functions of Analysis
- Lattices and factorization of polynomials
- Liouvillian Solutions of n-th Order Homogeneous Linear Differential Equations
- Summation in Finite Terms
- Complexity problems in computational theory
- Multivariate Polynomial Factorization
- Factoring Multivariate Polynomials Over the Integers
- On a theorem of Heilbronn
- Experiments with a symbolic programming system for complex analysis
- An Exact Method for Finding the Roots of a Complex Polynomial
- Functions Satisfying Elementary Relations
- A Remark on the Hensel Factorization Method
- Decision procedure for indefinite hypergeometric summation
- The Subresultant PRS Algorithm
- An Improved Multivariate Polynomial Factoring Algorithm
- A new symbolic integration system in reduce
- Fast parallel matrix and GCD computations
- The Computing Time of the Euclidean Algorithm
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Symbolic factoring of polynomials in several variables
- PM, a system for polynomial manipulation
- Subresultants and Reduced Polynomial Remainder Sequences
- Decision procedures for real and p‐adic fields
- Some undecidable problems involving elementary functions of a real variable
- The Problem of Integration in Finite Terms
- The solution of the problem of integration in finite terms
- Integer Arithmetic Algorithms for Polynomial Real Zero Determination
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- Algebra of Polynomials in Several Variables for a Digital Computer
- A Canonical Basis for the Ideals of a Polynomial Domain
- The number of steps in the Euclidean algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computer algebra: Past and future
