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=39
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructing transitive permutation groups
Alexander Hulpke
Journal Symbolic Computation
39
(1), 2005, pp. 1-30
Computing zero-dimensional schemes
J. Abbott
,
M. Kreuzer
,
L. Robbiano
Journal Symbolic Computation
39
(1), 2005, pp. 31-49
A new family of rational surfaces in
P^4
4
Hans-Christian Graf v. Bothmer
,
Cord Erdenberger
,
Katharina Ludwig
Journal Symbolic Computation
39
(1), 2005, pp. 51-60
Birational properties of the gap subresultant varieties
M'hammed El Kahoui
Journal Symbolic Computation
39
(1), 2005, pp. 61-71
Equations of parametric surfaces with base points via Syzygies
William A. Adkins
,
J. William Hoffman
,
Hao Hao Wang
Journal Symbolic Computation
39
(1), 2005, pp. 73-101
Good bases for tame polynomials
Mathias Schulze
Journal Symbolic Computation
39
(1), 2005, pp. 103-126
The Gröbner fan and Gröbner walk for modules
Ruth L. Auerbach
Journal Symbolic Computation
39
(2), 2005, pp. 127-153
Applicability of the
q
-analogue of Zeilberger's algorithm
William Y.C. Chen
,
Qing-Hu Hou
,
Yan-Ping Mu
Journal Symbolic Computation
39
(2), 2005, pp. 155-170
A new symbolic method for solving linear two-point boundary value problems on the level of operators
Markus Rosenkranz
Journal Symbolic Computation
39
(2), 2005, pp. 171-199
Sharp upper bounds for the orders of the recurrences output by the Zeilberger and
q
-Zeilberger algorithms
Mohamud Mohammed
,
Doron Zeilberger
Journal Symbolic Computation
39
(2), 2005, pp. 201-207
Towards a unified model of search in theorem-proving: Subgoal-reduction strategies
Maria Paola Bonacina
Journal Symbolic Computation
39
(2), 2005, pp. 209-255
Subresultants and generic monomial bases
Carlos D'Andrea
,
Gabriela Jeronimo
Journal Symbolic Computation
39
(3-4), 2005, pp. 259-277
Representation theory on the open Bruhat cell
Jan Draisma
Journal Symbolic Computation
39
(3-4), 2005, pp. 279-303
Irreducible decomposition of polynomial ideals
E. Fortuna
,
P. Gianni
,
B. Trager
Journal Symbolic Computation
39
(3-4), 2005, pp. 305-316
Semi-implicit representations of surfaces in
P^3
resultants and applications
Laurent Busé
,
André Galligo
Journal Symbolic Computation
39
(3-4), 2005, pp. 317-329
Algebraic geometry of Bayesian networks
Luis David Garcia
,
Michael Stillman
,
Bernd Sturmfels
Journal Symbolic Computation
39
(3-4), 2005, pp. 331-355
Quantum automata and algebraic groups
Harm Derksen
,
Emmanuel Jeandel
,
Pascal Koiran
Journal Symbolic Computation
39
(3-4), 2005, pp. 357-371
Algorithms for graded injective resolutions and local cohomology over semigroup rings
David Helm
,
Ezra Miller
Journal Symbolic Computation
39
(3-4), 2005, pp. 373-395
Bezoutian and quotient ring structure
B. Mourrain
Journal Symbolic Computation
39
(3-4), 2005, pp. 397-415
Tangent cone algorithm for homogenized differential operators
Michel Granger
,
Toshinori Oaku
,
Nobuki Takayama
Journal Symbolic Computation
39
(3-4), 2005, pp. 417-431
Effective analytic functions
Joris van der Hoeven
Journal Symbolic Computation
39
(3-4), 2005, pp. 433-449
Galois theory and algorithms for linear differential equations
Marius van der Put
Journal Symbolic Computation
39
(3-4), 2005, pp. 451-463
On constructive desingularization
Orlando Villamayor U.
Journal Symbolic Computation
39
(3-4), 2005, pp. 465-491
Algorithmic stratification of
RHom_D(M, N)
for regular algebraic
D
-modules on
C^n
]
Uli Walther
Journal Symbolic Computation
39
(3-4), 2005, pp. 493-499
A reconstruction and extension of Maple's assume facility via constraint contextual rewriting
Alessandro Armando
,
Clemens Ballarin
Journal Symbolic Computation
39
(5), 2005, pp. 503-521
Seiten 1
2
>