[Next][Prev] [_____] [Left] [Up] [Index] [Root]

Bibliography

Bj94
Johannes A. Buchmann and Hendrik W. Lenstra jr.
Approximating rings of integers in number fields.
J. Théor. Nombres Bordx., 6(2):221--260, 1994.

Bla05
I. Blake, G. Serrousi and N. Smart, editor.
Advances in Elliptic Curve Cryptography, volume 317 of LMS LNS.
Cambridge University Press, Cambridge, 2005.

Bue04
D. Buell, editor.
ANTS VI, volume 3076 of LNCS. Springer-Verlag, 2004.

CHM98
John H. Conway, Alexander Hulpke, and John McKay.
On transitive permutation groups.
LMS Journal of Computation and Mathematics, 1:1--8, 1998.

FK
C. Fieker and J. Klüners.
Computational Galois Theory I: Invariants and Computations over Q.
in preparation.

Gau00
P. Gaudry, F. Heß and N. P. Smart.
Constructive and destructive facets of Weil descent on elliptic curves.
J. Cryptology, 15(1):19--46, 2000.

Gei03
Katharina Geißler.
Berechnung von Galoisgruppen über Zahl- und Funktionenkörpern.
PhD Thesis, TU-Berlin, 2003.
available at http://www.math.tu-berlin.de/~kant/publications/diss/geissler.pdf.

GK00
Katharina Geißler and Jürgen Klüners.
The determination of Galois Groups.
J. Symbolic Comp., 30(6):653--674, 2000.

Heß99
Florian Heß.
Zur Divisorenklassengruppenberechnung in globalen Funktionenkörpern.
Dissertation, Technische Universität Berlin, 1999.
http://www.math.tu-berlin.de/~kant/publications/diss/diss_FH.ps.gz.

Heß04
Florian Heß.
An algorithm for computing isomorphisms of algebraic function fields.
In Buell [Bue04], pages 263--271.

Klü02
Jürgen Klüners.
Algorithms for Function Fields.
Exp. Math., (101):171--181, 2002.

SM85
Leonhard H. Soicher and John McKay.
Computing Galois Groups over the rationals.
J. Number Th., 20:273--281, 1985.

Sta73
Richard P. Stauduhar.
The determination of Galois Groups.
Math. Comp., 27:981--996, 1973.

Sti93
Henning Stichtenoth.
Algebraic function fields and codes.
Springer-Verlag, Berlin, 1993.

Sut
Nicole Sutherland.
Computing Galois Groups of Polynomials (especially over Function Fields of Prime Characteristic).
in preparation.

Sut12
Nicole Sutherland.
Efficient Computation of Maximal Orders of Radical (including Kummer) Extensions.
Journal of Symbolic Computation, 47:552--567, 2012.

Sut13
Nicole Sutherland.
Efficient Computation of Maximal Orders of Artin--Schreier Extensions.
Accepted by Journal of Symbolic Computation, 2013.

vHKN11
M. van Hoeij, J. Klüners, and A. Novocin.
Generating Subfields.
In Anton Leykin, editor, Proceedings ISSAC 2011, 2011.

 [Next][Prev] [_____] [Left] [Up] [Index] [Root]

Version: V2.19 of Mon Dec 17 14:40:36 EST 2012