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=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast computation of special resultants
Alin Bostan
,
Philippe Flajolet
,
Bruno Salvy
,
Éric Schost
Journal Symbolic Computation
41
(1), 2006, pp. 1-29
Local parametrization of cubic surfaces
Ibolya Szilágyi
,
Bert Jüttler
,
Josef Schicho
Journal Symbolic Computation
41
(1), 2006, pp. 30-48
New bounds for the Descartes method
Werner Krandick
,
Kurt Mehlhorn
Journal Symbolic Computation
41
(1), 2006, pp. 49-66
The unification type of the Pythagorean equation in varieties of nilpotent rings
G. Belitskii
,
R. Lipyanski
Journal Symbolic Computation
41
(1), 2006, pp. 67-79
A database of local fields
John W. Jones
,
David P. Roberts
Journal Symbolic Computation
41
(1), 2006, pp. 80-97
Gröbner finite path algebras
Micah J. Leamer
Journal Symbolic Computation
41
(1), 2006, pp. 98-111
Ideals, bifiltered modules and bivariate Hilbert polynomials
Giuseppa Carrá Ferro
Journal Symbolic Computation
41
(1), 2006, pp. 112-121
Retraction notice to ''Characterization of Pythagorean curves and Pythagoreanization using a rational transform''
Min-Ho Ahn
,
Gwang-Il Kim
Journal Symbolic Computation
41
(1), 2006, pp. 122-122
Resultants in genetic linkage analysis
Ingileif B. Hallgrímsdóttir
,
Bernd Sturmfels
Journal Symbolic Computation
41
(2), 2006, pp. 125-137
Phylogenetic invariants for stationary base composition
Elizabeth S. Allman
,
John A. Rhodes
Journal Symbolic Computation
41
(2), 2006, pp. 138-150
Viterbi sequences and polytopes
Eric H. Kuo
Journal Symbolic Computation
41
(2), 2006, pp. 151-163
Markov bases and structural zeros
Fabio Rapallo
Journal Symbolic Computation
41
(2), 2006, pp. 164-172
Markov bases of three-way tables are arbitrarily complicated
Jesús A. De Loera
,
Shmuel Onn
Journal Symbolic Computation
41
(2), 2006, pp. 173-181
Markov bases for noncommutative Fourier analysis of ranked data
Persi Diaconis
,
Nicholas Eriksson
Journal Symbolic Computation
41
(2), 2006, pp. 182-195
The space of compatible full conditionals is a unimodular toric variety
Aleksandra B. Slavkovic
,
Seth Sullivant
Journal Symbolic Computation
41
(2), 2006, pp. 196-209
Cumulant varieties
Giovanni Pistone
,
Henry P. Wynn
Journal Symbolic Computation
41
(2), 2006, pp. 210-221
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
Nicholas Eriksson
,
Stephen E. Fienberg
,
Alessandro Rinaldo
,
Seth Sullivant
Journal Symbolic Computation
41
(2), 2006, pp. 222-233
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
Max-Louis G. Buot
,
Donald St.P. Richards
Journal Symbolic Computation
41
(2), 2006, pp. 234-244
Computing all roots of the likelihood equations of seemingly unrelated regressions
Mathias Drton
Journal Symbolic Computation
41
(2), 2006, pp. 245-254
On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
Werner Heiß
,
Ulrich Oberst
,
Franz Pauer
Journal Symbolic Computation
41
(3-4), 2006, pp. 261-284
Comprehensive Gröbner bases and regular rings
Volker Weispfenning
Journal Symbolic Computation
41
(3-4), 2006, pp. 285-296
Tree polynomials and non-associative Gröbner bases
Lothar Gerritzen
Journal Symbolic Computation
41
(3-4), 2006, pp. 297-316
Gröbner bases and logarithmic
D
-modules
F.J. Castro-Jiménez
,
J.M. Ucha-Enríquez
Journal Symbolic Computation
41
(3-4), 2006, pp. 317-335
Lexicographic Gröbner bases for transportation problems of format
r \times 3 \times 3
Giandomenico Boffi
,
Fabio Rossi
Journal Symbolic Computation
41
(3-4), 2006, pp. 336-356
Gröbner-Shirshov bases for some braid groups
Leonid Bokut
,
Andrei Vesnin
Journal Symbolic Computation
41
(3-4), 2006, pp. 357-371
Seiten 1
2
3
4
>