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 YEAR=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Critical pair criteria for completion
Leo Bachmair
,
Nachum Dershowitz
Journal Symbolic Computation
6
(1), 1988, pp. 1-18
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Deepak Kapur
,
David R. Musser
,
Paliath Narendran
Journal Symbolic Computation
6
(1), 1988, pp. 19-36
Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
Abdelilah Kandri-Rody
,
Deepak Kapur
Journal Symbolic Computation
6
(1), 1988, pp. 37-57
Tietze transformations with weighted substring search
Edmund F. Robertson
Journal Symbolic Computation
6
(1), 1988, pp. 59-64
Parallel scheduling of recursively defined arrays
Thomas J. Myers
,
Maya B. Gokhale
Journal Symbolic Computation
6
(1), 1988, pp. 65-81
The automation of syllogistic - I. Syllogistic normal forms
Domenico Cantone
,
Susanna Ghelfo
,
Eugenio Omodeo
Journal Symbolic Computation
6
(1), 1988, pp. 83-98
The word problem for free partially commutative groups
C. Wrathall
Journal Symbolic Computation
6
(1), 1988, pp. 99-104
An algorithm for determining the simplicity of a modular group representation
Gerhard O. Michler
Journal Symbolic Computation
6
(1), 1988, pp. 105-111
Minimum number of fundamental invariants for the binary form of degree 7
J. Dixmier
,
D. Lazard
Journal Symbolic Computation
6
(1), 1988, pp. 113-115
On a particular restricted five-body problem - An analysis with computer algebra
Alexander Ollongren
Journal Symbolic Computation
6
(1), 1988, pp. 117-126
Computer algebra applied to itself
J.H. Davenport
Journal Symbolic Computation
6
(1), 1988, pp. 127-132
On the complexity of computing Syzygies
David Bayer
,
Michael Stillman
Journal Symbolic Computation
6
(2-3), 1988, pp. 135-147
Lifting canonical algorithms for a ring
R
to the ring
R[x]
R. Shtokhamer
Journal Symbolic Computation
6
(2-3), 1988, pp. 169-181
Standard bases and geometric invariant theory - I. Initial ideals and state polytopes
David Bayer
,
Ian Morrison
Journal Symbolic Computation
6
(2-3), 1988, pp. 209-217
Gröbner bases and Hilbert schemes - I.
Giuseppa Carrà Ferro
Journal Symbolic Computation
6
(2-3), 1988, pp. 219-230
Computing dimension and independent sets for polynomial ideals
Heinz Kredel
,
Volker Weispfenning
Journal Symbolic Computation
6
(2-3), 1988, pp. 231-247
Combinatorial dimension theory of algebraic varieties
Marc Giusti
Journal Symbolic Computation
6
(2-3), 1988, pp. 249-265
On an installation of Buchberger's algorithm
Rüdiger Gebauer
,
H. Michael Möller
Journal Symbolic Computation
6
(2-3), 1988, pp. 275-286
Constructive lifting in graded structures: A unified view of Buchberger and Hensel methods
A. Miola
,
T. Mora
Journal Symbolic Computation
6
(2-3), 1988, pp. 305-322
On the computation of generalized standard bases
Michela Brundu
,
Fabio Rossi
Journal Symbolic Computation
6
(2-3), 1988, pp. 323-343
On the construction of Gröbner bases using Syzygies
H. Michael Möller
Journal Symbolic Computation
6
(2-3), 1988, pp. 345-359
An extension of Buchberger's algorithm and calculations in enveloping fields of Lie algebras
J. Apel
,
W. Lassner
Journal Symbolic Computation
6
(2-3), 1988, pp. 361-370
On recognisable properties of associative algebras
Tatiana Gateva-Ivanova
,
Victor Latyshev
Journal Symbolic Computation
6
(2-3), 1988, pp. 371-388
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
Seiten 1
2
>