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=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
Isabel Bermejo
,
Ignacio García-Marco
,
Juan José Salazar-González
Journal Symbolic Computation
42
(10), 2007, pp. 971-991
Symbolic computation with finite biquandles
Conrad Creel
,
Sam Nelson
Journal Symbolic Computation
42
(10), 2007, pp. 992-1000
Gröbner bases with coefficients in rings
Franz Pauer
Journal Symbolic Computation
42
(11-12), 2007, pp. 1003-1011
An algorithmic approach to resolutions
Edward L. Green
,
Øyvind Solberg
Journal Symbolic Computation
42
(11-12), 2007, pp. 1012-1033
Complete involutive rewriting systems
Gareth A. Evans
,
Christopher D. Wensley
Journal Symbolic Computation
42
(11-12), 2007, pp. 1034-1051
Poincaré-Birkhoff-Witt theorem for Leibniz
n
-algebras
José Manuel Casas
,
Manuel A. Insua
,
Manuel Ladra
Journal Symbolic Computation
42
(11-12), 2007, pp. 1052-1065
Graphs of relations and Hilbert series
Peter Cameron
,
Natalia Iyudu
Journal Symbolic Computation
42
(11-12), 2007, pp. 1066-1078
Set-theoretic solutions of the Yang-Baxter equation, graphs and computations
Tatiana Gateva-Ivanova
,
Shahn Majid
Journal Symbolic Computation
42
(11-12), 2007, pp. 1079-1112
Computation of bases of free modules over the Weyl algebras
Alban Quadrat
,
Daniel Robertz
Journal Symbolic Computation
42
(11-12), 2007, pp. 1113-1141
Gröbner bases and the number of Latin squares related to autotopisms of order
\le 7
R.M. Falcón
,
J. Martín-Morales
Journal Symbolic Computation
42
(11-12), 2007, pp. 1142-1154
Seiten
<
1
2
3