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 Volume=43
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solving thousand-digit Frobenius problems using Gröbner bases
Bjarke Hammersholt Roune
Journal Symbolic Computation
43
(1), 2008, pp. 1-7
Algorithms for computing with nilpotent matrix groups over infinite domains
A.S. Detinko
,
D.L. Flannery
Journal Symbolic Computation
43
(1), 2008, pp. 8-26
Universal characteristic decomposition of radical differential ideals
Oleg Golubitsky
Journal Symbolic Computation
43
(1), 2008, pp. 27-45
Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)
Agnes Szanto
Journal Symbolic Computation
43
(1), 2008, pp. 46-74
Counting with rational generating functions
Sven Verdoolaege
,
Kevin Woods
Journal Symbolic Computation
43
(2), 2008, pp. 75-91
Computing singular points of plane rational curves
Falai Chen
,
Wenping Wang
,
Yang Liu
Journal Symbolic Computation
43
(2), 2008, pp. 92-117
A univariate resultant-based implicitization algorithm for surfaces
Sonia Pérez-Díaz
,
J. Rafael Sendra
Journal Symbolic Computation
43
(2), 2008, pp. 118-139
Algorithms for quadratic forms
Przemysƚaw Koprowski
Journal Symbolic Computation
43
(2), 2008, pp. 140-152
Completion of overdetermined parabolic PDEs
Katsiaryna Krupchyk
,
Jukka Tuomela
Journal Symbolic Computation
43
(3), 2008, pp. 153-167
Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm
Laurent Dupont
,
Daniel Lazard
,
Sylvain Lazard
,
Sylvain Petitjean
Journal Symbolic Computation
43
(3), 2008, pp. 168-191
Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils
Laurent Dupont
,
Daniel Lazard
,
Sylvain Lazard
,
Sylvain Petitjean
Journal Symbolic Computation
43
(3), 2008, pp. 192-215
Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections
Laurent Dupont
,
Daniel Lazard
,
Sylvain Lazard
,
Sylvain Petitjean
Journal Symbolic Computation
43
(3), 2008, pp. 216-232
Corrigendum to ``Are Buchberger's criteria necessary for the chain condition?''
Hoon Hong
,
John Perry
Journal Symbolic Computation
43
(3), 2008, pp. 233-233
Topology of real algebraic space curves
M'hammed El Kahoui
Journal Symbolic Computation
43
(4), 2008, pp. 235-258
On the decomposition of rational functions
Mohamed Ayad
,
Peter Fleischmann
Journal Symbolic Computation
43
(4), 2008, pp. 259-274
On the homology of two-dimensional elimination
Jooyoun Hong
,
Aron Simis
,
Wolmer V. Vasconcelos
Journal Symbolic Computation
43
(4), 2008, pp. 275-292
Descent via isogeny on elliptic curves with large rational torsion subgroups
E.V. Flynn
,
C. Grattoni
Journal Symbolic Computation
43
(4), 2008, pp. 293-303
Localization of the complex zeros of parametrized families of polynomials
Stéphane R. Louboutin
Journal Symbolic Computation
43
(4), 2008, pp. 304-309
An efficient sparse adaptation of the polytope method over
F_p
and a record-high binary bivariate factorisation
Fatima K. Abu Salem
Journal Symbolic Computation
43
(5), 2008, pp. 311-341
The largest group of invariance for Markov bases and toric ideals
Satoshi Aoki
,
Akimichi Takemura
Journal Symbolic Computation
43
(5), 2008, pp. 342-358
Approximate factorization of multivariate polynomials using singular value decomposition
Erich Kaltofen
,
John P. May
,
Zhengfeng Yang
,
Lihong Zhi
Journal Symbolic Computation
43
(5), 2008, pp. 359-376
Dimensions of solution spaces of
H
-systems
S.A. Abramov
,
M. Petkovs̑ek
Journal Symbolic Computation
43
(5), 2008, pp. 377-394
Gröbner-Shirshov basis for the braid group in the Artin-Garside generators
L.A. Bokut
Journal Symbolic Computation
43
(6-7), 2008, pp. 397-405
Universally defined representations of Lie conformal superalgebras
Pavel Kolesnikov
Journal Symbolic Computation
43
(6-7), 2008, pp. 406-421
The degree-complexity of the defining ideal of a smooth integral curve
Jeaman Ahn
Journal Symbolic Computation
43
(6-7), 2008, pp. 422-441
Seiten 1
2
>