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
[1]
Hilfe
Suche: Author="Weispfenning, V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Gröbner bases and Syzygies on bimodules over PBW algebras
Manuel García Román
,
Socorro García Román
Journal Symbolic Computation
40
(3), 2005, pp. 1039-1052
A new approach to quantifier elimination for real algebra
V. Weispfenning
Texts and Monographs in Symbolic Computation
, 1998, pp. 376-392
Finite Gröbner bases in non-Noetherian skew polynomial rings
V. Weispfenning
Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, ISSAC'92 (Berkeley, California, July 27-29, 1992)
, 1992, pp. 329-334
Non-commutative Gröbner bases in algebras of solvable type
A. Kandri-Rody
,
V. Weispfenning
Journal Symbolic Computation
9
(1), 1990, pp. 1-26
The complexity of almost linear diophantine problems
V. Weispfenning
Journal Symbolic Computation
10
, 1990, pp. 395-403
Comprehensive Gröbner bases
V. Weispfenning
Technical Report (MIP-9003), 1990
Computing dimension and independent sets for polynomial ideals
H. Kredel
,
V. Weispfenning
Computational aspects of commutative algebra, 1989, pp. 97-113
Efficient decision procedures for locally finite theories II
V. Weispfenning
Lecture Notes in Computer Science
358
, 1989, pp. 390-401
Gröbner bases for polynomial ideals over commutative regular rings
V. Weispfenning
Lecture Notes in Computer Science
378
, 1989, pp. 336-347
The complexity of the word problem for Abelian l-groups
V. Weispfenning
Theoretical Computer Science
48
(1), 1986, pp. 127-132
The complexity of elementary problems in Archimedean ordered groups
V. Weispfenning
Lecture Notes in Computer Science
204
, 1985, pp. 87-88