Readings Newsletter
Become a Readings Member to make your shopping experience even easier.
Sign in or sign up for free!
You’re not far away from qualifying for FREE standard shipping within Australia
You’ve qualified for FREE standard shipping within Australia
The cart is loading…
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
This volume presents the refereed proceedings of the 1st Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, New York, in May 1994. The 35 papers accepted for inclusion in this book address many issues of the algorithmic, computational and complexity-theoretic aspects of number theory. The book also contributes to foundational research in cryptology and coding. Of particular value is a collection entitled Open Problems in Number Theoretic Complexity , which presents 36 central open problems and relates them to the literature by means of some 160 references.
$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
This volume presents the refereed proceedings of the 1st Algorithmic Number Theory Symposium, ANTS-I, held at Cornell University, New York, in May 1994. The 35 papers accepted for inclusion in this book address many issues of the algorithmic, computational and complexity-theoretic aspects of number theory. The book also contributes to foundational research in cryptology and coding. Of particular value is a collection entitled Open Problems in Number Theoretic Complexity , which presents 36 central open problems and relates them to the literature by means of some 160 references.