EUROSM '79, An International Symposium on Symbolic and Algebraic Manipulation, Marseille, France, June 1979
First Statement of Responsibility
edited by Edward W. Ng.
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Berlin, Heidelberg
Name of Publisher, Distributor, etc.
Springer Berlin Heidelberg
Date of Publication, Distribution, etc.
1979
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
(XVII, 563 p. :)
SERIES
Series Title
Lecture notes in computer science, 72.
CONTENTS NOTE
Text of Note
A criterion for detecting unnecessary reductions in the construction of Gröbner-bases --; Unification of commutative terms --; Canonicality in rule systems --; The application of symbolic algebra to physics - A case of creeping flow --; Progress towards a solution of the equivalence problem in general relativity --; Symbol calculus by symbolic computation and semi-classical expansions --; An algorithm for the analytic evaluation of a class of integrals --; Fast computation of the rational hermite interpolant and solving toeplitz systems of equations via the extended Euclidean algorithm --; Approximate algorithms to derive exact solutions to systems of linear equations --; New recursive minor expansion algorithms, a presentation in a comparative context --; Systems of algebraic equations --; On the van der waerden criterion for the group of an equation --; Some computations related to torsion points on elliptic curves over number fields --; The computerisation of algebraic geometry --; ^ Algebraic extensions of arbitrary integral domains --; On unit computation in real quadratic fields --; An algebraic form of a solution of a system of linear differential equations with constant coefficients --; Substitution methods for the automatic symbolic solution of differential equations of first order and first degree --; A semi-numeric difference algorithm --; Convergence behaviour of the Newton iteration for first order differential equations --; Probabilistic algorithms for verification of polynomial identities --; Probabilistic algorithms for sparse polynomials --; Non-modular computation of polynomial GCDS using trial division --; Product of symmetric and anti-symmetric polynomials --; Capabilities of the mumath-79 computer algebra system for the intel-8080 microprocessor --; CAMAC 1979 --; The initial design of a vector based algebra system --; Hashing - the key to rapid pattern matching --; ^ A system for automatic generation of tensor algorithms and indicial tensor calculus, including substitution of sums --; Analysis of the p-adic construction of multivariate correction coefficiencts in polynomial factorization: Iteration vs. recursion --; A cellular decomposition algorithm for semialgebraic sets --; Gamma-algebra algorithms for canonical hypercomplex representations --; Factoring univariate integral polynomials in polynomial average time --; Symbolic-numeric interface: A review --; A note on methods for solving systems of polynomial equations with floating point coefficients --; An arbitrary precision real arithmetic package in REDUCE --; Symbolic preprocessing in interval function computing --; Approximate rational arithmetic systems: Analysis of recovery of simple fractions during expression evaluation --; Symbolic integration - the dust settles? --; Integration of simple radical extensions --; Algorithms for the integration of algebraic functions --; ^ An extension of liouville's theorem --; Integer matrices and Abelian groups --; An algorithm for the computation of conjugacy classes and centralizers in p-groups --; MODLISP: An introduction --; Extending interlisp for modularization and efficiency --; TLISP - A "transportable-lisp" implemented in pcode --; Symbolic computing with compression of data structures: General observations, and a case study --; On the design of algebraic data structures with the approach of abstract data types --; Matching under commutativity --; ?-algebra algorithms for canonical hypercomplex representations.