Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Algorithmic Number Theory
  • Cited by 2
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      May 2025
      October 2008
      ISBN:
      9781139049801
      9780521808545
      9780521208338
      DOI:
      https://doi.org/10.1017/9781139049801
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      1.03kg, 664 Pages
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      0.92kg, 664 Pages
      • Subjects:
      Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Real and Complex Analysis, Computer Science, Number Theory
      Series:
      Mathematical Sciences Research Institute Publications (44)
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Real and Complex Analysis, Computer Science, Number Theory
    Series:
    Mathematical Sciences Research Institute Publications (44)
    Information

    Book description

    Number theory is one of the oldest and most appealing areas of mathematics. Computation has always played a role in number theory, a role which has increased dramatically in the last 20 or 30 years, both because of the advent of modern computers, and because of the discovery of surprising and powerful algorithms. As a consequence, algorithmic number theory has gradually emerged as an important and distinct field with connections to computer science and cryptography as well as other areas of mathematics. This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field. It includes several articles that cover the essential topics in this area, and in addition, there are contributions pointing in broader directions, including cryptography, computational class field theory, zeta functions and L-series, discrete logarithm algorithms, and quantum computing.

    Reviews

    Review of the hardback:'… can be warmly recommended to anyone interested in the fascinating area of computational number theory.'

    Source: EMS Newsletter

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.