Abstract is missing.
- Homogeneous Linear Difference Equation (Frobenius - Boole Method)Jean Della Dora, Evelyne Tournier. 2-12
- An Experiment Toward a General Quadrature for Second Order Linear Ordinary Differential Equations by Symbolic ComputationShunro Watanbe. 13-22
- Operational Calculus Technique for Solving Differential EquationsNikolaos Glinos, B. David Saunders. 23-34
- On the Application of Symbolic Computation to Nonlinear Control TheoryG. Cesareo, R. Marino. 35-46
- Quartic Equations and Algorithms for Riemann Tensor ClassificationJan E. Åman, R. A. d Inverno, G. C. Joly, Malcolm A. H. MacCallum. 47-58
- Symbolic Computation and the Dirichlet ProblemRalph W. Wilkerson. 59-63
- Simplification of Polynomials in n VariablesGuy Viry. 64-73
- On the Equivalence of Hierarchical and Non-Hierarchical Rewriting on Conditional Term Rewriting SystemsMarisa Navarro, Fernando Orejas. 74-85
- Implementation of a p-adic Package for Polynomial Factorization and Other Related OperationsPaul S. Wang. 86-99
- Computations on CurvesClaire Dicrescenzo, Dominique Duval. 100-107
- Detecting Torsion Divisors on Curves of Genus 2Thomas G. Berry. 108-114
- Computation in Radical ExtensionsH. Najid-Zejli. 115-122
- A Primer: 11 Keys to New ScratchpadRichard D. Jenks. 123-147
- A Pure and Really Simple Initial Functional Algebraic LanguageJohn Fitch, Julian A. Padget. 148-158
- Some Effectivity Problems in Polynomial Ideal TheoryMarc Giusti. 159-171
- Upper and Lower Bounds for the Degree of Groebner BasesH. Michael Möller, Ferdinando Mora. 172-183
- On the Complexity of the Groebner-Bases Algorithm over K[x, y, z]Franz Winkler. 184-194
- Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean RingsAbdelilah Kandri-Rody, Deepak Kapur. 195-206
- Computations with Rational Subsets of Confluent GroupsRobert H. Gilman. 207-212
- CAMAC2: A Portable System for Combinatorial and Algebraic ComputationJeffrey S. Leon. 213-224
- Polynomial Time Algorithms for Galois GroupsSusan Landau. 225-236
- Code Generation and Optimization for Finite Element AnalysisPaul S. Wang, T. Y. P. Chang, J. A. van Hulzen. 237-247
- A Comparison of Algorithms for the Symbolic Computation of Padé ApproximantsStephen R. Czapor, Keith O. Geddes. 248-259
- Automatic Error Cumulation ControlBen J. A. Hulshof, J. A. van Hulzen. 260-271
- Polynomial Factorization by Root ApproximationArjen K. Lenstra. 272-276
- Effective Hilbert IrreducibilityErich Kaltofen. 277-284
- GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD ComputationBruce W. Char, Keith O. Geddes, Gaston H. Gonnet. 285-296
- A New Lifting Process for the Multivariate Polynomial FactorizationDenis Lugiez. 297-309
- Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields with Class Numbers 7 and 11Erich Kaltofen, Noriko Yui. 310-320
- On a Simple Primality Testing AlgorithmMing-Deh A. Huang. 321-332
- A Criterion for the Equivalence of Two IdealsJohannes Buchmann. 333-340
- y + fy = gJames H. Davenport. 341-350
- Integration in Finite Terms with Special Functions: A Progress ReportGuy W. Cherry, B. F. Caviness. 351-358
- A Note on the Risch Differential EquationErich Kaltofen. 359-366
- Approximation by Continued Fraction of a Polynomial Real RootKlaus Thull. 367-377
- On the Automatic Resolution of Certain Diophantine EquationsMaurice Mignotte. 378-385
- On Pseudo-ResultanteMichael Rothstein. 386-396