Ebook: Algorithmic Number Theory: Second International Symposium, ANTS-II Talence, France, May 18–23, 1996 Proceedings
- Genre: Education // International Conferences and Symposiums
- Tags: Algorithm Analysis and Problem Complexity, Data Encryption, Discrete Mathematics in Computer Science, Number Theory, Algorithms, Algebraic Geometry
- Series: Lecture Notes in Computer Science 1122
- Year: 1996
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- djvu
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.
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.
Download the book Algorithmic Number Theory: Second International Symposium, ANTS-II Talence, France, May 18–23, 1996 Proceedings for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)