default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal 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 - James H. Davenport, Joos Heintz:
Real Quantifier Elimination is Doubly Exponential. 29-35 - Dima Grigoriev, Nicolai N. Vorobjov Jr.:
Solving Systems of Polynomial Inequalities in Subexponential Time. 37-64 - Dima Grigoriev:
Complexity of Deciding Tarski Algebra. 65-108 - Jean-Jacques Risler:
Some Aspects of Complexity in Real Algebraic Geometry. 109-119 - 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 - Stefan Arnborg, Huichun Feng:
Algebraic Decomposition of Regular Curves. 131-140 - Scott McCallum
:
An Improved Projection Operation for Cylindrical Algebraic Decomposition of Three-Dimensional Space. 141-161 - Dennis S. Arnon, George E. Collins, Scott McCallum:
An Adjacency Algorithm for Cylindrical Algebraic Decompositions of Three-Dimensional Space. 163-187 - Dennis S. Arnon:
A Cluster-Based Cylindrical Algebraic Decomposition Algorithm. 189-212 - Dennis S. Arnon, Scott McCallum:
A Polynomial-Time Algorithm for the Topological Type of a Real Algebraic Curve. 213-236 - Dennis S. Arnon, Maurice Mignotte:
On Mechanical Quantifier Elimination for Elementary Algebra and Geometry. 237-259 - Daniel Lazard:
Quantifier Elimination: Optimal Solution for Two Classical Examples. 261-266 - Dennis S. Arnon:
A Bibliography of Quantifier Elimination for Real Closed Fields. 267-274
Volume 5, Number 3, June 1988
- Gregory Butler:
A Proof of Holt's Algorithm. 275-283 - Stephen P. Glasby:
Constructing Normalisers in Finite Soluble Groups. 285-294 - Stephen P. Glasby:
Intersecting Subgroups of Finite Soluble Groups. 295-301 - Hidetsune Kobayashi, Tetsuro Fujise, Akio Furukawa:
Solving Systems of Algebraic Equations by a General Elimination Method. 303-320 - Shojiro Sakata:
Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array. 321-337 - Klaus Madlener, Friedrich Otto:
Pseudo-Natural Algorithms for Finitely Generated Presentations of Monoids and Groups. 339-358 - Grigori Mints, Enn Tyugu:
The Programming System PRIZ. 359-375 - Martin L. Sage:
An Algebraic Treatment of Quantum Vibrations Using REDUCE. 377-384 - C. P. Mawata:
Solving the Heat Equation Symbolically with MuSimp. 385-389
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-23 19:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
