Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Symbolic Computation AND Volume=5
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of linear problems in fields
Volker Weispfenning
Journal Symbolic Computation
5
(1-2), 1988, pp. 3-27
Real quantifier eliminations is doubly exponential
James H. Davenport
,
Joos Heintz
Journal Symbolic Computation
5
(1-2), 1988, pp. 29-35
Solving systems of polynomial inequalities in subexponential time
D.Yu. Grigor'ev
,
N.N., Jr. Vorobjov
Journal Symbolic Computation
5
(1-2), 1988, pp. 37-64
Complexity of deciding Tarski algebra
D.Yu. Grigor'ev
Journal Symbolic Computation
5
(1-2), 1988, pp. 65-108
Some aspects of complexity in real algebraic geometry
Jean-Jacques Risler
Journal Symbolic Computation
5
(1-2), 1988, pp. 109-119
Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
M. Coste
,
M.F. Roy
Journal Symbolic Computation
5
(1-2), 1988, pp. 121-129
Algebraic decomposition of regular curves
Stefan Arnborg
,
Huichun Feng
Journal Symbolic Computation
5
(1-2), 1988, pp. 131-140
An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
Scott McCallum
Journal Symbolic Computation
5
(1-2), 1988, pp. 141-161
An adjacency algorithm for cylindrical algebraic decompositions of three-dimensional space
Dennis S. Arnon
,
George E. Collins
,
Scott McCallum
Journal Symbolic Computation
5
(1-2), 1988, pp. 163-187
A cluster-based cylindrical algebraic decomposition algorithm
Dennis S. Arnon
Journal Symbolic Computation
5
(1-2), 1988, pp. 189-212
A polynomial-time algorithm for the topological type of a real algebraic curve
Dennis S. Arnon
,
Scott McCallum
Journal Symbolic Computation
5
(1-2), 1988, pp. 213-236
On mechanical quantifier elimination for elementary algebra and geometry
Dennis S. Arnon
,
Maurice Mignotte
Journal Symbolic Computation
5
(1-2), 1988, pp. 237-259
Quantifier elimination: Optimal solution for two classical examples
Daniel Lazard
Journal Symbolic Computation
5
(1-2), 1988, pp. 261-266
A bibliography of quantifier elimination for real closed fields
Dennis S. Arnon
Journal Symbolic Computation
5
(1-2), 1988, pp. 267-274
A proof of Holt's algorithm
Gregory Butler
Journal Symbolic Computation
5
(3), 1988, pp. 275-283
Constructing normalisers in finite soluble groups
S.P. Glasby
Journal Symbolic Computation
5
(3), 1988, pp. 285-294
Intersecting subgroups of finite soluble groups
S.P. Glasby
Journal Symbolic Computation
5
(3), 1988, pp. 295-301
Solving systems of algebraic equations by a general elimination method
Hidetsune Kobayashi
,
Tetsuro Fujise
,
Akio Furukawa
Journal Symbolic Computation
5
(3), 1988, pp. 303-320
Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
Shojiro Sakata
Journal Symbolic Computation
5
(3), 1988, pp. 321-337
Pseudo-natural algorithms for finitely generated presentations of monoids and groups
Klaus Madlener
,
Friedrich Otto
Journal Symbolic Computation
5
(3), 1988, pp. 339-358
The programming system PRIZ
G. Mints
,
E. Tyugu
Journal Symbolic Computation
5
(3), 1988, pp. 359-375
An algebraic treatment of quantum vibrations using REDUCE
Martin L. Sage
Journal Symbolic Computation
5
(3), 1988, pp. 377-384
Solving the heat equation symbolically with MuSimp
C.P. Mawata
Journal Symbolic Computation
5
(3), 1988, pp. 385-389