Symbolic and Algebraic Computation

The ISSAC'88 is the thirteenth conference in a sequence of international events started in 1966 thanks to the then established ACM Special Interest Group on Symbolic and Algebraic Manipulation (SIGSAM). For the first time the two annual conferences "International Symposium on Symbolic and Algebraic Computation" (ISSAC) and "International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes" (AAECC) have taken place as a Joint Conference in Rome, July 4-8, 1988. Twelve invited papers on subjects of common interest for the two conferences are included in the proceedings and divided between this volume and the preceding volume of Lecture Notes in Computer Science which is devoted to AAECC-6. This book contains contributions on the following topics: Symbolic, Algebraic and Analytical Algorithms, Automatic Theorem Proving, Automatic Programming, Computational Geometry, Problem Representation and Solution, Languages and Systems for Symbolic Computation, Applications to Sciences, Engineering and Education.

Inhalt
Dynamic maintenance of paths and path expressions on graphs.- Generic programming.- From a noncomputability result to new interesting definitions and computability results.- Symbolic derivation and automatic generation of parallel routines for finite element analysis.- Liouvillian first integrals of differential equations.- Fast reduction of the Risch differential equation.- An application of reduce to the approximation of F(X,Y).- The use of symbolic computation in solving some non-relativistic quantum mechanical problems.- Experiments with quadtree representation of matrices.- Discovering inequality conditions in the analytical solution of optimization problems.- Can EXCALC be used to investigate high-dimensional cosmological models with non-linear Lagrangians?.- Gröbner trace algorithms.- Solving systems of algebraic equations.- Groebner bases in non-commutative algebras.- Greater easy common divisor and standard basis completion algorithms.- Experiments with a projection operator for algebraic decomposition.- Rational Newton algorithm for computing formal solutions of linear differential equations.- An ordinary differential equation solver for REDUCE.- A fixed point method for power series computation.- An algorithm for symbolic computation of center manifolds.- Shortest division chains in imaginary quadratic number fields.- Effective tests for cyclotomic polynomials.- The probability of relative primality of Gaussian integers.- Some computational aspects of root finding in GF(qm).- Symbolic computation for Witt rings.- Computations with algebraic curves.- On the computational complexity of the resolution of plane curve singularities.- Generalized characteristic polynomials.- Decomposition of algebras.- Algebraic transformations of polynomial equations, symmetricpolynomials and elimination.- Tetrahedrizing point sets in three dimensions.- A generalization of the roider method to solve the robot collision problem in 3D.- Symbolic analysis of planar drawings.- A geometrical decision algorithm based on the gröbner bases algorithm.- Solving permutation problems using rewriting systems.- Applying rewriting techniques to groups with power-commutation-presentations.- Efficient decision procedures for locally finite theories II.- Aformal approach to some usually informal techniques used in mathematical reasoning.- Decision procedures for elementary sublanguages of set theory. XIV. Three languages involving rank related constructs.- Computer algebra on MIMD machine.- Algebraic extensions and algebraic closure in Scratchpad II.- Software development for computer algebra or from ALDES/SAC-2 to WEB/Modula-2.- Cayley, version 4: The user language.- Improved sparse multivariate polynomial interpolation algorithms.- Heuristic methods for operations with algebraic numbers.- Asymptotic estimation of oscillating functions using an interval calculus.- A new algorithm for computing symbolic limits using hierarchical series.- Verification of non-identities in algebras.- Equations in words.- Cayley factorization.- Complexity of computing the characters and the genre of a system of exterior differential equations.