A. Lechner; M. Schrödl; R. Weiß; E. Brenner; P. Seifter; W. Kosta; G. Raimann; F. Furtner; D. Kirchner; H. Bühler; Nem Springer Verlag GmbH (1989) Pehmeäkantinen kirja
Leo Andergassen; Martin Foradori; Hansjörg Hafner; Paul Hafner; P. Plazidus-Karl Hungerbühler; Martin Kilchmann; A Kofler Athesia Tappeiner Verlag (2024) Kovakantinen kirja
Number theory is one of the oldest and most appealing areas of mathematics. Computation has always played a role in number theory, a role which has increased dramatically in the last 20 or 30 years, both because of the advent of modern computers, and because of the discovery of surprising and powerful algorithms. As a consequence, algorithmic number theory has gradually emerged as an important and distinct field with connections to computer science and cryptography as well as other areas of mathematics. This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field. It includes several articles that cover the essential topics in this area, and in addition, there are contributions pointing in broader directions, including cryptography, computational class field theory, zeta functions and L-series, discrete logarithm algorithms, and quantum computing.
