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=31
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Factoring polynomials over finite fields: A survey
Joachim von zur Gathen
,
Daniel Panario
Journal Symbolic Computation
31
(1-2), 2001, pp. 3-17
On the deterministic complexity of factoring polynomials
Shuhong Gao
Journal Symbolic Computation
31
(1-2), 2001, pp. 19-36
Some applications of Magma in designs and codes: Oval designs, Hermitian unitals and generalized Reed-Muller codes
J.D. Key
Journal Symbolic Computation
31
(1-2), 2001, pp. 37-53
Constructions in finite geometry using computer algebra systems
G.L. Ebert
Journal Symbolic Computation
31
(1-2), 2001, pp. 55-70
Classical invariants and 2-descent on elliptic curves
J.E. Cremona
Journal Symbolic Computation
31
(1-2), 2001, pp. 71-87
Irregular primes and cyclotomic invariants to 12 Million
Joe Buhler
,
Richard Crandall
,
Reijo Ernvall
,
Tauno Metsänkylä
,
M. Amin Shokrollahi
Journal Symbolic Computation
31
(1-2), 2001, pp. 89-96
Class number relations from a computational point of view
Wieb Bosma
,
Bart de Smit
Journal Symbolic Computation
31
(1-2), 2001, pp. 97-112
On computations in Kummer extensions
Mario Daberkow
Journal Symbolic Computation
31
(1-2), 2001, pp. 113-131
Algorthmic methods for finitely generated Abelian groups
Henri Cohen
,
Francisco Diaz y Diaz
,
Michel Olivier
Journal Symbolic Computation
31
(1-2), 2001, pp. 133-147
Computing the subgroups of a permutation group
John J. Cannon
,
Bruce C. Cox
,
Derek F. Holt
Journal Symbolic Computation
31
(1-2), 2001, pp. 149-161
Determination of socle series using the condensation method
Klaus Lux
,
Markus Wiegelmann
Journal Symbolic Computation
31
(1-2), 2001, pp. 163-178
Computing double cosets in soluble groups
Michael C. Slattery
Journal Symbolic Computation
31
(1-2), 2001, pp. 179-192
Computing in the Monster
Simon Norton
Journal Symbolic Computation
31
(1-2), 2001, pp. 193-201
A new existence proof for Ly, the sporadic simple group of R. Lyons
Holger W. Gollan
Journal Symbolic Computation
31
(1-2), 2001, pp. 203-209
Embeddings of
PSL(2,41)
and
PSL(2,49)
in
E_8(C)
Robert L., Jr. Griess
,
A.J.E. Ryba
Journal Symbolic Computation
31
(1-2), 2001, pp. 211-227
Calculating group cohomology: Tests for completion
Jon F. Carlson
Journal Symbolic Computation
31
(1-2), 2001, pp. 229-242
A new approach to primary decomposition
Alain Sausse
Journal Symbolic Computation
31
(1-2), 2001, pp. 243-257
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
Ulla Koppenhagen
,
Ernst W. Mayr
Journal Symbolic Computation
31
(1-2), 2001, pp. 259-276
Unification of concept terms in description logics
Franz Baader
,
Paliath Narendran
Journal Symbolic Computation
31
(3), 2001, pp. 277-305
Counting and Gröbner bases
K. Kalorkoti
Journal Symbolic Computation
31
(3), 2001, pp. 307-313
Sylvester-Habicht sequences and fast Cauchy index computation
Thomas Lickteig
,
Marie-Françoise Roy
Journal Symbolic Computation
31
(3), 2001, pp. 315-341
Implicitization of a general union of parametric varieties
F. Orecchia
Journal Symbolic Computation
31
(3), 2001, pp. 343-356
An implicitization algorithm for rational surfaces with no base points
Franck Aries
,
Rachid Senoussi
Journal Symbolic Computation
31
(4), 2001, pp. 357-365
Decomposition plans for geometric constraint systems - Part I: Performance measures for CAD
Christoph M. Hoffman
,
Andrew Lomonosov
,
Meera Sitharam
Journal Symbolic Computation
31
(4), 2001, pp. 367-408
Decomposition plans for geometric constraint problems - Part II: New algorithms
Christoph M. Hoffman
,
Andrew Lomonosov
,
Meera Sitharam
Journal Symbolic Computation
31
(4), 2001, pp. 409-427
Seiten 1
2
>