Computational Number Theory, Past, Present, and Future

DOI10.1007/978-3-031-12244-6_38OpenAlexW4376624884MaRDI QIDQ6082847

Henri Cohen

Publication date: 3 December 2023

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-12244-6_38

zbMATH Keywords

computational number theory

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Class numbers, class groups, discriminants (11R29)

Cites Work

• Densities of quartic fields with even Galois groups
• Notes on elliptic curves. II.
• On the density of discriminants of cubic fields. II
• Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions : a survey of recent results
• Some Calculations of the Riemann Zeta-Function
• The Density of Abelian Cubic Fields
• Counting points on superelliptic curves in average polynomial time
• Number Theory
• Number Theory
• Waring's problem for sixteen biquadrates -- numerical results
• Computing \(L\)-functions: a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Double tails of multiple zeta values
• The \(L\)-functions and Modular Forms Database project
• Finite hypergeometric functions
• The density of discriminants of quintic rings and fields
• The development of the number field sieve
• Explicit computation of isomorphisms between finite fields
• The 4-class ranks of quadratic fields
• On the 4-rank of class groups of quadratic number fields
• Factoring polynomials over global fields
• The LLL algorithm. Survey and applications
• Factoring integers with elliptic curves
• Solving Thue equations of high degree
• Factoring polynomials with rational coefficients
• Icosahedral Galois representations
• The Magma algebra system. I: The user language
• Computing isometries of lattices
• PRIMES is in P
• On the computation of units and class numbers by a generalization of Lagrange's algorithm
• Factorization of certain cyclotomic functions
• Moments and interpretations of the Cohen-Lenstra-Martinet heuristics
• Upper bounds on number fields of given degree and bounded discriminant
• Computing groups of Hecke characters
• Enumerating number fields
• Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
• Counting points on hyperelliptic curves in average polynomial time
• The density of discriminants of quartic rings and fields
• Hecke operators on \(\Gamma_0(m)\)
• Computational problems, methods, and results in algebraic number theory
• A relative van Hoeij algorithm over number fields
• Contributions to the theory of the Dirichlet \(L\)-series and the Epstein zeta-functions
• Integer multiplication in time \(O(n\log n)\)
• Explicit versions of the prime ideal theorem for Dedekind zeta functions under GRH
• Shorter Compact Representations in Real Quadratic Fields
• On the evaluation of modular polynomials
• Computational Aspects of Modular Forms and Galois Representations
• Computing modular polynomials in quasi-linear time
• Computing Hilbert class polynomials with the Chinese remainder theorem
• Random maximal isotropic subspaces and Selmer groups
• Elliptic Curves and Primality Proving
• The Mahler measure of algebraic numbers: a survey
• High precision computation of Riemann’s zeta function by the Riemann-Siegel formula, I
• Sato-Tate distributions
• The Conductor Density of Abelian Number Fields
• Effective computation of Maass cusp forms
• Computing zeta functions of arithmetic schemes
• A Rigorous Subexponential Algorithm For Computation of Class Groups
• Fast Algorithms for Multiple Evaluations of the Riemann Zeta Function
• Asymptotically fast group operations on Jacobians of general curves
• Gauss’ class number problem for imaginary quadratic fields
• Primality Testing and Jacobi Sums
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Implementation of a new primality test
• On the density of discriminants of quartic fields.
• Modèles minimaux des courbes de genre deux.
• A fast algorithm to compute cubic fields
• Computing ray class groups, conductors and discriminants
• An efficient algorithm for the computation of Galois automorphisms
• Class numbers of imaginary quadratic fields
• Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
• Constructing complete tables of quartic fields using Kummer theory
• On the Distribution of Galois Groups, II
• Computing Special Values of MotivicL-Functions
• Class Invariants by the CRT Method
• Advanced Topics in Computional Number Theory
• Computational Number Theory in Relation with L-Functions
• An improvement on Schmidt’s bound on the number of number fields of bounded discriminant and small degree
• Sato–Tate groups of abelian threefolds: a preview of the classification
• Hypergeometric Motives
• HEURISTICS FOR THE ARITHMETIC OF ELLIPTIC CURVES
• Bounds on 2-torsion in class groups of number fields and integral points on elliptic curves
• Paramodular cusp forms
• Explicit Methods for Hilbert Modular Forms
• Artin's Conjecture, Turing's Method, and the Riemann Hypothesis
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• The ternary Goldbach problem
• Floating-Point LLL Revisited
• Overconvergent modular symbols and $p$-adic $L$-functions
• Paramodular abelian varieties of odd conductor
• Reflection Principles and Bounds for Class Group Torsion
• Small generators of the ideal class group

This page was built for publication: Computational Number Theory, Past, Present, and Future