Computational Number Theory
Computational Number Theory is a branch of number theory that focuses on the development and analysis of algorithms for solving problems related to integers, prime numbers, and other number-theoretic structures using computational methods.
2.4K
Publications
109.8K
Citations
3K
Authors
1.1K
Institutions
Publications per year
2017–2026
213
Parents
Children
Aks Primality TestAlgebraic Number Field ComputationsArithmetic Of Finite FieldsBaby-step Giant-step AlgorithmChinese Remainder Theorem AlgorithmsClass Number ComputationComputational Algebraic GeometryComputational Galois TheoryComputing Special Values Of L-functionsComputing Zeta Functions
2.4K
Sphere Packings, Lattices and Groups.
H. S. M. Coxeter, J. H. Conway, N. J. A. Sloane · American Mathematical Monthly · 1989 · 3.5K citations
1–5 of 2.4K
3K
16
h-index
15
h-index
15
h-index
13
h-index
12
h-index
1–5 of 3K
1.1K

Centre National de la Recherche Scientifique
Paris, France
29 h-index
109 publications
4.4K citations
Massachusetts Institute of Technology
Cambridge, United States
23 h-index
41 publications
2K citations

University of Waterloo
Waterloo, Canada
23 h-index
66 publications
2.9K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
19 h-index
56 publications
1.8K citations
University of California, Los Angeles
Los Angeles, United States
18 h-index
27 publications
925 citations
Simon Fraser University
Burnaby, Canada
17 h-index
37 publications
2.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
17 h-index
37 publications
1.2K citations

Tel Aviv University
Tel Aviv, Israel
16 h-index
30 publications
1.9K citations
1–8 of 1.1K
MCOM · 266 publications · 13.6K citations
50
h-index
65 publications · 3.3K citations
32
h-index
45 publications · 5.4K citations
31
h-index
59 publications · 2.5K citations
30
h-index
46 publications · 5K citations
25
h-index
1–5