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: Author="Pohst, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Kant V4
M. Daberkow
,
C. Fieker
,
J. Klüners
,
M. Pohst
,
K. Roegner
,
M. Schörnig
,
K. Wildanger
Journal Symbolic Computation
24
(3-4), 1997, pp. 267-283
On computing Hilbert class fields of prime degree
M. Daberkow
,
M.E. Pohst
Lecture Notes in Computer Science
1122
, 1996, pp. 67-74
On lattices over number fields
C. Fieker
,
M.E. Pohst
Lecture Notes in Computer Science
1122
, 1996, pp. 133-139
On integral basis reduction in global function fields
M.E. Pohst
,
M. Schörnig
Lecture Notes in Computer Science
1122
, 1996, pp. 273-282
Computational aspects of Kummer theory
M.E. Pohst
Lecture Notes in Computer Science
1122
, 1996, pp. 259-272
Computations with relative extensions of number fields with an application to the construction of Hilbert class fields
M. Daberkow
,
M. Pohst
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ISSAC'95 (Montreal, Canada, July 10-12, 1995)
, 1995, pp. 68-76
On the resolution of index form equations
I. Gaál
,
A. Pethö
,
M. Pohst
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, ISSAC'91 (Bonn, Germany, July 15-17, 1991)
, 1991, pp. 185-186
Computing a lattice basis from a system of generating vectors
J. Buchmann
,
M. Pohst
Lecture Notes in Computer Science
378
, 1989, pp. 54-63
On the complexity of computing class groups of algebraic number fields
J. Buchmann
,
M. Pohst
Lecture Notes in Computer Science
357
, 1989, pp. 122-130
A modification of the LLL reduction algorithm
M. Pohst
Journal Symbolic Computation
4
(1), 1987, pp. 123-127
A new method of computing fundamental units in algebraic number fields
U. Fincke
,
M. Pohst
Lecture Notes in Computer Science
204
, 1985, pp. 470-478