Journal of Symbolic Computation, Volume 5, 1988

Volume 5, Number 1/2, Februar/April 1988

• Volker Weispfenning: The Complexity of Linear Problems in Fields. 3-27 BibTeX
• James H. Davenport, Joos Heintz: Real Quantifier Elimination is Doubly Exponential. 29-35 BibTeX
• Dima Grigoriev, Nicolai Vorobjov: Solving Systems of Polynomial Inequalities in Subexponential Time. 37-64 BibTeX
• Dima Grigoriev: Complexity of Deciding Tarski Algebra. 65-108 BibTeX
• Jean-Jacques Risler: Some Aspects of Complexity in Real Algebraic Geometry. 109-119 BibTeX
• Michel Coste, Marie-Françoise Roy: Thom's Lemma, the Coding of Real Algebraic Numbers and the Computation of the Topology of Semi-Algebraic Sets. 121-129 BibTeX
• Stefan Arnborg, Huichun Feng: Algebraic Decomposition of Regular Curves. 131-140 BibTeX
• Scott McCallum: An Improved Projection Operation for Cylindrical Algebraic Decomposition of Three-Dimensional Space. 141-161 BibTeX
• Dennis S. Arnon, George E. Collins, Scott McCallum: An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space. 163-187 BibTeX
• Dennis S. Arnon: A Cluster-Based Cylindrical Algebraic Decomposition Algorithm. 189-212 BibTeX
• Dennis S. Arnon, Scott McCallum: A Polynomial-Time Algorithm for the Topological Type of a Real Algebraic Curve. 213-236 BibTeX
• Dennis S. Arnon, Maurice Mignotte: On Mechanical Quantifier Elimination for Elementary Algebra and Geometry. 237-259 BibTeX
• Daniel Lazard: Quantifier Elimination: Optimal Solution for Two Classical Examples. 261-266 BibTeX
• Dennis S. Arnon: A Bibliography of Quantifier Elimination for Real Closed Fields. 267-274 BibTeX

Volume 5, Number 3, June 1988

• Gregory Butler: A Proof of Holt's Algorithm. 275-283 BibTeX
• Stephen P. Glasby: Constructing Normalisers in Finite Soluble Groups. 285-294 BibTeX
• Stephen P. Glasby: Intersecting Subgroups of Finite Soluble Groups. 295-301 BibTeX
• Hidetsune Kobayashi, Tetsuro Fujise, Akio Furukawa: Solving Systems of Algebraic Equations by a General Elimination Method. 303-320 BibTeX
• Shojiro Sakata: Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array. 321-337 BibTeX
• Klaus Madlener, Friedrich Otto: Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups. 339-358 BibTeX
• Grigori Mints, Enn Tyugu: The Programming System PRIZ. 359-375 BibTeX
• Martin L. Sage: An Algebraic Treatment of Quantum Vibrations Using REDUCE. 377-384 BibTeX
• C. P. Mawata: Solving the Heat Equation Symbolically with MuSimp. 385-389 BibTeX