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=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing the primary decomposition of zero-dimensional ideals
Chris Monico
Journal Symbolic Computation
34
(5), 2002, pp. 451-459
An algorithmic for isolating the real solutions of semi-algebraic systems
Bican Xia
,
Lu Yang
Journal Symbolic Computation
34
(5), 2002, pp. 461-477
Relax, but don't be too lazy
Joris van der Hoeven
Journal Symbolic Computation
34
(6), 2002, pp. 479-542
Real solving for positive dimensional systems
Philippe Aubry
,
Fabrice Rouillier
,
Mohab Safey El Din
Journal Symbolic Computation
34
(6), 2002, pp. 543-560
Decomposing monomial representations of solvable groups
Markus Püschel
Journal Symbolic Computation
34
(6), 2002, pp. 561-596
Taylor and Lyubeznik resolutions via Gröbner bases
Werner M. Seiler
Journal Symbolic Computation
34
(6), 2002, pp. 597-608
Introduction to the GiNaC framework for symbolic computation within the C++ programming language
Christian Bauer
,
Alexander Frink
,
Richard Kreckel
Journal Symbolic Computation
33
(1), 2002, pp. 1-12
Fast computation of the Bezout and Dixon resultant matrices
Eng-Wee Chionh
,
Ming Zhang
,
Ronald N. Goldman
Journal Symbolic Computation
33
(1), 2002, pp. 13-29
Constructing faithful representations of finitely-generated torsion-free nilpotent groups
Willem A. de Graaf
,
Werner Nickel
Journal Symbolic Computation
33
(1), 2002, pp. 31-41
Continuously parameterized symmetries and Buchberger's algorithm
Ralf Hemmecke
Journal Symbolic Computation
33
(1), 2002, pp. 43-55
On the computation of elementary divisors of integer matrices
Frank Lübeck
Journal Symbolic Computation
33
(1), 2002, pp. 57-65
SAGBI bases under composition
Patrik Nordbeck
Journal Symbolic Computation
33
(1), 2002, pp. 67-76
Solvability of context equations with two context variables is decidable
Manfred Schmidt-Schauss̈
,
Klaus U. Schulz
Journal Symbolic Computation
33
(1), 2002, pp. 77-122
FFT-like multiplication of linear differential operators
Joris van der Hoeven
Journal Symbolic Computation
33
(1), 2002, pp. 123-127
Computing subgroups by exhibition in finite solvable groups
Bettina Eick
,
Charles R.B. Wright
Journal Symbolic Computation
33
(2), 2002, pp. 129-143
Computing transformation semigroups
S.A. Linton
,
G. Pfeiffer
,
E.F. Robertson
,
N. Rus̑kuc
Journal Symbolic Computation
33
(2), 2002, pp. 145-162
Regular Gröbner bases
Jonas MÅnsson
,
Patrik Nordbeck
Journal Symbolic Computation
33
(2), 2002, pp. 163-181
A new algorithm for discussing Gröbner bases with parameters
Antonio Montes
Journal Symbolic Computation
33
(2), 2002, pp. 183-208
Gröbner bases in orders of algebraic number fields
David Andrew Smith
Journal Symbolic Computation
33
(2), 2002, pp. 209-220
The inverse Gröbner basis problem in codimension two
Amelia Taylor
Journal Symbolic Computation
33
(2), 2002, pp. 221-238
Approximate solutions of polynomial equations
Shih Ping Tung
Journal Symbolic Computation
33
(2), 2002, pp. 239-254
Identities for the associator in alternative algebras
Murray Bremer
,
Irvin Hentzel
Journal Symbolic Computation
33
(3), 2002, pp. 255-273
A family of sparse polynomial systems arising in chemical reaction systems
Karin Gatermann
,
Birkett Huber
Journal Symbolic Computation
33
(3), 2002, pp. 275-305
Predicting zero coefficients in formal power series computations
K. Kalorkoti
Journal Symbolic Computation
33
(3), 2002, pp. 307-320
Local box adjacency algorithms for cylindrical algebraic decompositions
Scott McCallum
,
George E. Collins
Journal Symbolic Computation
33
(3), 2002, pp. 321-342
Seiten
<
1
2
3
4
>