Computer Algebra: EUROCAL’83, European Computer Algebra Conference London, England, March 28–30, 1983 Proceedings (Lecture Notes in Computer Science, 162)

Edited By J.a. Van Hulzen. Includes Bibliographical References And Index. Introduction....Pages 1-1 Integration — What do we want from the theory?....Pages 2-11 The Euclidean algorithm for Gaussian integers....Pages 12-23 Multi polynomial remainder sequence and its application to linear diophantine equations....Pages 24-35 Towards mechanical solution of the Kahan ellipse problem I....Pages 36-44 Automatically determining symmetries of ordinary differential equations....Pages 45-54 Algebraic computation of the statistics of the solution of some nonlinear stochastic differential equations....Pages 55-67 Characterization of a linear differential system with a regular singularity....Pages 68-77 The Bath Concurrent LISP machine....Pages 78-90 The ecology of LISP or the case for the preservation of the environment....Pages 91-100 The design of Maple: A compact, portable, and powerful computer algebra system....Pages 101-115 LISP compilation viewed as provable semantics preserving program transformation....Pages 116-127 Implementing REDUCE on a microcomputer....Pages 128-136 A note on the complexity of constructing Gröbner-bases....Pages 137-145 Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations....Pages 146-156 The computation of the Hilbert function....Pages 157-167 An algorithm for constructing detaching bases in the ring of polynomials over a field....Pages 168-179 On the problem of Behā Eddīn 'Amūlī and the computation of height functions....Pages 180-193 A procedure for determining algebraic integers of given norm....Pages 194-202 Computation of integral solutions of a special type of systems of quadratic equations....Pages 203-213 Factorisation of sparse polynomials....Pages 214-224 Early detection of true factors in univariate polynomial factorization....Pages 225-235 On the complexity of finding short vectors in integer lattices....Pages 236-244 Factoring polynomials over algebraic number fields....Pages 245-254 The construction of a complete minimal set of contextual normal forms....Pages 255-266 A knowledge-based approach to user-friendliness in symbolic computing....Pages 267-274 Computer algebra and VLSI, prospects for cross fertilization....Pages 275-285 Code optimization of multivariate polynomial schemes: A pragmatic approach....Pages 286-300 This volume is the third in a series dedicated to a computer algebra conference. These symposia are noted for presenting well qualified research results, encouraging discussion of thoughts, ideas, recent research trends, and prospects for future success. This volume consists of sixteen papers, and covers important theoretical results, algorithms, software methods, and recent applications. It gives an overview of the state of computer algebra, and the fascinating aspects which might lead to numerous applications