Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3076)
Conference series link(s): ANTS: International Algorithmic Number Theory Symposium
Conference proceedings info: ANTS 2004.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (33 papers)
-
Front Matter
-
Contributed Papers
About this book
Keywords
- Farey sequence
- Prime
- algebraic geometry
- algebraic number fields
- algebraic number theory
- algorithmic number theory
- algorithms
- complexity
- computational number theory
- elliptic curve computations
- factoring
- finite field computations
- number theory
- statistics
- zeta functions
- algorithm analysis and problem complexity
Editors and Affiliations
-
Department of Computer Science and Engineering, University of South Carolina , Columbia, USA
Duncan Buell
Bibliographic Information
Book Title: Algorithmic Number Theory
Book Subtitle: 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings
Editors: Duncan Buell
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b98210
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2004
Softcover ISBN: 978-3-540-22156-2Published: 01 June 2004
eBook ISBN: 978-3-540-24847-7Published: 04 May 2004
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 456
Topics: Number Theory, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Cryptology, Symbolic and Algebraic Manipulation, Algorithms