About these proceedings
This volume presents the refereed proceedings of the First Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, Ithaca, NY in May 1994.
The 35 papers accepted for inclusion in this book address many current issues of algorithmic, computational and complexity-theoretic aspects of number theory and thus report the state-of-the-art in this exciting area of research; the book also contributes essentially to foundational research in cryptology and coding.
Of particular value is a collection entitled "Open Problems in Number Theoretic Complexity, II" contributed by Len Adleman and Kevin McCurley. This survey presents on 32 pages 36 central open problems and relates them to the literature by means of some 160 references.
Finite Fields Greatest Common Divisor (GCD) Größtter Gemeinsamer Teiler Integer Factorization Number theory Polynom-Faktorisierung Polynominal Factorization Siebmethoden Sieve Methods algorithms ants complexity
Springer-Verlag Berlin Heidelberg 1994
Springer, Berlin, Heidelberg
Springer Book Archive
Series Print ISSN
Series Online ISSN
Buy this book on publisher's site