About these proceedings
This book constitutes the refereed post-conference proceedings of the Second International Algorithmic Number Theory Symposium, ANTS-II, held in Talence, France in May 1996.
The 35 revised full papers included in the book were selected from a variety of submissions. They cover a broad spectrum of topics and report state-of-the-art research results in computational number theory and complexity theory. Among the issues addressed are number fields computation, Abelian varieties, factoring algorithms, finite fields, elliptic curves, algorithm complexity, lattice theory, and coding.
Algorithmische Zahlentheorie Algorithms Computational Number Theory Constructive Mathematics Komplexitätstheorie Numbertheoretical Algorithms Zahlentheoretische Algorithmen algorithm complexity complexity theory finite field number theory
Springer-Verlag Berlin Heidelberg 1996
Springer, Berlin, Heidelberg
Springer Book Archive
Series Print ISSN
Series Online ISSN
Buy this book on publisher's site