Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 877)
Included in the following conference series:
Conference proceedings info: ANTS 1994.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (35 papers)
Other volumes
-
Algorithmic Number Theory
Bibliographic Information
Book Title: Algorithmic Number Theory
Book Subtitle: First International Symposium, ANTS-I, Ithaca, NY, USA, May 6 - 9, 1994. Proceedings
Editors: Leonard M. Adleman, Ming-Deh Huang
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-58691-1
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1994
Softcover ISBN: 978-3-540-58691-3Published: 15 November 1994
eBook ISBN: 978-3-540-49044-9Published: 02 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 320
Topics: Data Structures, Number Theory, Discrete Mathematics, Symbolic and Algebraic Manipulation, Algorithm Analysis and Problem Complexity, Combinatorics