A course in computational algebraic number theory:
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Cohen, Henri 1947- (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Berlin, Heidelberg Springer Berlin Heidelberg 1993
Schriftenreihe:Graduate Texts in Mathematics 138
Schlagworte:
Online-Zugang:UPA01
Volltext
Beschreibung:With the advent of powerful computing tools and numerous advances in mathematics, computer science and cryptography, algorithmic number theory has become an important subject in its own right. Both external and internal pressures gave a powerful impetus to the development of more powerful algorithms. These in turn led to a large number of spectacular breakthroughs. To mention but a few, the LLL algorithm which has a wide range of applications, including real world applications to integer programming, primality testing and factoring algorithms, sub-exponential class group and regulator algorithms, etc ... Several books exist which treat parts of this subject. (It is essentially impossible for an author to keep up with the rapid pace of progress in all areas of this subject.) Each book emphasizes a different area, corresponding to the author's tastes and interests. The most famous, but unfortunately the oldest, is Knuth's Art of Computer Programming, especially Chapter 4. The present book has two goals. First, to give a reasonably comprehensive introductory course in computational number theory. In particular, although we study some subjects in great detail, others are only mentioned, but with suitable pointers to the literature. Hence, we hope that this book can serve as a first course on the subject. A natural sequel would be to study more specialized subjects in the existing literature
Beschreibung:1 Online-Ressource (XXI, 534 Seiten)
ISBN:9783662029459
ISSN:0072-5285
DOI:10.1007/978-3-662-02945-9

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen