Preview
Unable to display preview. Download preview PDF.
References
S.I. Borewics und I,R. Safarevič, Zahlentheorie, Birkhäuser-Verlag, Basel und Stuttgart 1966, pp. 134–141.
U. Dieter, How to Calculate Shortest Vectors in a Lattice, Math. Comp., v. 29, 131, (1975), pp. 827–833.
D.E. Knuth, The art of computer programming, vol.2, Addison-Wesley, sec.ed. (1981), p.95.
A.K. Lenstra, H.W. Lenstr Jr., L. Lovász, Factoring Polynomials with Rational Coefficients, Math. Ann. 261 (1982), 515–534.
K. Mahler, Inequalities for Ideal Bases in Algebraic Number Fields, J. Austral. Math. Soc. 4, (1964), pp. 425–447.
M. Pohst u. H. Zassenhaus, An effective number geometric method of computing the fundamental units of an algebraic number field, Math. Comp., v. 31, 1977, pp. 754–770.
M. Pohst, P. Weiler u. H. Zassenhaus, On effective computation of fundamental units I,II, Math. Comp., v. 38, 1982, pp. 275–329.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Fincke, U., Pohst, M. (1983). A procedure for determining algebraic integers of given norm. In: van Hulzen, J.A. (eds) Computer Algebra. EUROCAL 1983. Lecture Notes in Computer Science, vol 162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12868-9_103
Download citation
DOI: https://doi.org/10.1007/3-540-12868-9_103
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12868-7
Online ISBN: 978-3-540-38756-5
eBook Packages: Springer Book Archive