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=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing Riemann-Roch spaces in algebraic function fields and related topics
F. Hess
Journal Symbolic Computation
33
(4), 2002, pp. 425-445
Sparse resultant of composed polynomials I - Mixed-unmixed case
Hoon Hong
,
Manfred Minimair
Journal Symbolic Computation
33
(4), 2002, pp. 447-465
Sparse resultant of composed polynomials II - Mixed-unmixed case
Manfred Minimair
Journal Symbolic Computation
33
(4), 2002, pp. 467-478
Solving genus zero diophantine equations with at most two infinite valuations
Dimitrios Poulakis
,
Evaggelos Voskos
Journal Symbolic Computation
33
(4), 2002, pp. 479-491
Quantified constraints under perturbation
Stefan Ratschan
Journal Symbolic Computation
33
(4), 2002, pp. 493-505
A Mathematica program for the degrees of certain Schubert varieties
Xu An Zhao
,
Haibao Duan
Journal Symbolic Computation
33
(4), 2002, pp. 507-517
Rational normal forms and minimal decompositions of hypergeometric terms
S.A. Abramov
,
M. Petkovs̑ek
Journal Symbolic Computation
33
(5), 2002, pp. 521-543
On multivariate rational function decomposition
Jaime Gutierrez
,
Rosario Rubio
,
David Sevilla
Journal Symbolic Computation
33
(5), 2002, pp. 545-562
Scalable parallel coset enumeration: Bulk definition and the memory wall
Gene Cooperman
,
Victor Grinberg
Journal Symbolic Computation
33
(5), 2002, pp. 563-585
Hybrid sparse resultant matrices for bivariate polynomials
Carlos D'Andrea
,
Ioannis Z. Emiris
Journal Symbolic Computation
33
(5), 2002, pp. 587-608
Derivations and radicals of polynomial ideals over fields of arbitrary charateristic
E. Fortuna
,
P. Gianni
,
B. Trager
Journal Symbolic Computation
33
(5), 2002, pp. 609-625
An iterated eigenvalue algorithm for approximating roots of univariate polynomials
Steven Fortune
Journal Symbolic Computation
33
(5), 2002, pp. 627-646
On computer-assisted classification of coupled integrable equations
Mikhail V. Foursov
,
Marc Moreno Maza
Journal Symbolic Computation
33
(5), 2002, pp. 647-660
Irreducible decomposition of curves
André Galligo
,
David Rupprecht
Journal Symbolic Computation
33
(5), 2002, pp. 661-677
Relations between roots and coefficients, interpolation and application to system solving
Bernard Mourrain
,
Olivier Ruatta
Journal Symbolic Computation
33
(5), 2002, pp. 679-699
Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Victor Y. Pan
Journal Symbolic Computation
33
(5), 2002, pp. 701-733
A probabilistic algorithm to test local algebraic observability in polynomial time
Alexandre Sedoglavic
Journal Symbolic Computation
33
(5), 2002, pp. 735-755
Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
Emmanuel Thomé
Journal Symbolic Computation
33
(5), 2002, pp. 757-775
Cancellative Abelian monoids and related structures in refutational theorem proving (Part I)
Uwe Waldmann
Journal Symbolic Computation
33
(6), 2002, pp. 777-829
Cancellative Abelian monoids and related structures in refutational theorem proving (Part II)
Uwe Waldmann
Journal Symbolic Computation
33
(6), 2002, pp. 831-861
Normal parametrizations of algebraic plane curves
J. Rafael Sendra
Journal Symbolic Computation
33
(6), 2002, pp. 863-885
Calculating the Galois group of
Y'=AY+B, Y'+AY
completely reducible
Peter Berman
Journal Symbolic Computation
33
(6), 2002, pp. 887-898
Seiten
<
1
2