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
[2]
Hilfe
Suche: Journal=J. Symbolic Computation AND Volume=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A fast algorithm for Gröbner basis conversion and its applications
Quoc-Nam Tran
Journal Symbolic Computation
30
(4), 2000, pp. 451-467
Gröbner bases applied to finitely generated field extensions
Jörn Müller-Quade
,
Rainer Steinwandt
Journal Symbolic Computation
30
(4), 2000, pp. 469-490
A systematic framework for solving geometric constraints analytically
Cassiano Durand
,
Christoph M. Hoffmann
Journal Symbolic Computation
30
(5), 2000, pp. 493-519
Computing orbits of minimal parabolic
k
-subgroups acting on symmetric
k
-varieties
Aloysius G. Helminck
Journal Symbolic Computation
30
(5), 2000, pp. 521-553
An algorithm for the Quillen-Suslin theorem for quotients of polynomial rings by monomial ideals
Reinhard Laubenbacher
,
Karen Schlauch
Journal Symbolic Computation
30
(5), 2000, pp. 555-571
On the practical solution of genus zero diophantine equations
Dimitrios Poulakis
,
Evaggelos Voskos
Journal Symbolic Computation
30
(5), 2000, pp. 573-582
Proper parametrization of real tubular surfaces
Josef Schicho
Journal Symbolic Computation
30
(5), 2000, pp. 583-593
Divisorial extensions and the computation of integral closures
Wolmer V. Vasconcelos
Journal Symbolic Computation
30
(5), 2000, pp. 595-604
(1+i)
-ary GCD computation in
Z[i]
as an analogue to the binary GCD algorithm
André Weilert
Journal Symbolic Computation
30
(5), 2000, pp. 605-617
The symbolic integration of exact PDEs
Thomas Wolf
Journal Symbolic Computation
30
(5), 2000, pp. 619-629
Special issue on algorithmic methods in Galois theory - Foreword of the guest editors
B.H. Matzat
,
J. McKay
,
K. Yokoyama
Journal Symbolic Computation
30
(6), 2000, pp. 631-633
Using Galois ideals for computing relative resolvents
Philippe Aubry
,
Annick Valibouze
Journal Symbolic Computation
30
(6), 2000, pp. 635-651
Galois group computation for rational polynomials
Katharina Geissler
,
Jürgen Klüners
Journal Symbolic Computation
30
(6), 2000, pp. 653-674
Explicit Galois realization of transitive groups of degree up to 15
Jürgen Klüners
,
Gunter Malle
Journal Symbolic Computation
30
(6), 2000, pp. 675-716
Multi-parameter polynomials with given Galois group
Gunter Malle
Journal Symbolic Computation
30
(6), 2000, pp. 717-731
A polynomial with Galois group
SL_2(11)
Jürgen Klüners
Journal Symbolic Computation
30
(6), 2000, pp. 733-737
Boundary of Hurwitz spaces and explicit patching
Jean-Marc Couveignes
Journal Symbolic Computation
30
(6), 2000, pp. 739-759
An algorithm of Katz and its application to the inverse Galois problem
Michael Dettweiler
,
Stefan Reiter
Journal Symbolic Computation
30
(6), 2000, pp. 761-798
Projective linear groups as Galois groups over
Q
via modular representationss
Luis Dieulefait
,
Núria Vila
Journal Symbolic Computation
30
(6), 2000, pp. 799-810
Explicit solutions of Galois embedding problems by means of generalized Clifford algebras
Montserrat Vela
Journal Symbolic Computation
30
(6), 2000, pp. 811-842
Generic polynomials with few parameters
Gregor Kemper
,
Elena Mattig
Journal Symbolic Computation
30
(6), 2000, pp. 843-857
Generic and explicit realization of small
p
-groups
Arne Ledet
Journal Symbolic Computation
30
(6), 2000, pp. 859-865
Generic extensions and generic polynomials
Arne Ledet
Journal Symbolic Computation
30
(6), 2000, pp. 867-872
Seiten
<
1
2