Skip to main content
Springer Nature Link
Account

Algorithmic Number Theory

7th International Symposium, ANTS-VII, Berlin, Germany, July 23-28, 2006, Proceedings

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Florian Hess

    1. Technische Universität Berlin, Germany

  2. Sebastian Pauli

    1. Institut für Mathematik, MA 8–1, Technische Universität Berlin, Berlin, Germany

  3. Michael Pohst

    1. Institut für Mathematik, Technische Universität Berlin, Fakultät II, Berlin, Germany

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4076)

Included in the following conference series:

Conference proceedings info: ANTS 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (41 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Computing Pro-P Galois Groups

      • Nigel Boston, Harris Nover
      Pages 1-10

    2. The Elliptic Curve Database for Conductors to 130000

      • John Cremona
      Pages 11-29

    3. On the Computation of the Coefficients of a Modular Form

      • Bas Edixhoven
      Pages 30-39

    4. Cohen–Lenstra Heuristics of Quadratic Number Fields

      • Étienne Fouvry, Jürgen Klüners
      Pages 40-55

  3. Algebraic Number Theory

    1. An Algorithm for Computing p-Class Groups of Abelian Number Fields

      • Miho Aoki, Takashi Fukuda
      Pages 56-71

    2. Computation of Locally Free Class Groups

      • Werner Bley, Robert Boltje
      Pages 72-86

    3. Numerical Results on Class Groups of Imaginary Quadratic Fields

      • Michael J. Jacobson Jr., Shantha Ramachandran, Hugh C. Williams
      Pages 87-101

    4. Cyclic Polynomials Arising from Kummer Theory of Norm Algebraic Tori

      • Masanari Kida
      Pages 102-113

    5. The Totally Real Primitive Number Fields of Discriminant at Most 109

      • Gunter Malle
      Pages 114-123

    6. A Modular Method for Computing the Splitting Field of a Polynomial

      • Guénaël Renault, Kazuhiro Yokoyama
      Pages 124-140

  4. Analytic and Elementary Number Theory

    1. On the Density of Sums of Three Cubes

      • Jean-Marc Deshouillers, François Hennecart, Bernard Landreau
      Pages 141-155

    2. The Mertens Conjecture Revisited

      • Tadej Kotnik, Herman te Riele
      Pages 156-167

    3. Fast Bounds on the Distribution of Smooth Numbers

      • Scott T. Parsell, Jonathan P. Sorenson
      Pages 168-181

    4. Use of Extended Euclidean Algorithm in Solving a System of Linear Diophantine Equations with Bounded Variables

      • Parthasarathy Ramachandran
      Pages 182-192

    5. The Pseudosquares Prime Sieve

      • Jonathan P. Sorenson
      Pages 193-207

    6. Doubly-Focused Enumeration of Pseudosquares and Pseudocubes

      • Kjell Wooding, Hugh C. Williams
      Pages 208-221

  5. Lattices

    1. Practical Lattice Basis Sampling Reduction

      • Johannes Buchmann, Christoph Ludwig
      Pages 222-237

    2. LLL on the Average

      • Phong Q. Nguyen, Damien Stehlé
      Pages 238-256

    3. On the Randomness of Bits Generated by Sufficiently Smooth Functions

      • Damien Stehlé
      Pages 257-274
Back to top

Other volumes

  1. Algorithmic Number Theory

Editors and Affiliations

  • Technische Universität Berlin, Germany

    Florian Hess

  • Institut für Mathematik, MA 8–1, Technische Universität Berlin, Berlin, Germany

    Sebastian Pauli

  • Institut für Mathematik, Technische Universität Berlin, Fakultät II, Berlin, Germany

    Michael Pohst

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top