Algorithmic Number Theory
Algorithmic Number Theory is a branch of computational mathematics that systematically studies algorithms for solving problems in number theory, distinguished by its focus on the design, analysis, and implementation of effective procedures for number-theoretic computations.
68
Publications
4.6K
Citations
114
Authors
75
Institutions
Publications per year
2017–2026
7
Parents
68
Introduction to Mathematical Logic.
Angelo Margaris, Alonzo Church · American Mathematical Monthly · 1957 · 935 citations
Probabilistic Algorithms in Finite Fields
Michael O. Rabin · SIAM Journal on Computing · 1980 · 319 citations
Martin Fürer · 2007 · 246 citations
Martin Fürer · SIAM Journal on Computing · 2009 · 216 citations · Full text
1–5 of 68
114
2
h-index
2
h-index
2
h-index
Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, France
2 publications · 47 citations
2
h-index
2
h-index
1–5 of 114
75

Tel Aviv University
Tel Aviv, Israel
4 h-index
7 publications
210 citations

The University of Melbourne
Melbourne, Australia
3 h-index
3 publications
122 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
256 citations

UNSW Sydney
Sydney, Australia
2 h-index
2 publications
94 citations
Laboratoire d'Informatique de l'École Polytechnique
Palaiseau, France
2 h-index
4 publications
188 citations
Indian Institute of Technology Kharagpur
Kharagpur, India
2 h-index
2 publications
25 citations

University of Calgary
Calgary, Canada
2 h-index
2 publications
45 citations
Leiden University
Leiden, The Netherlands
2 h-index
2 publications
36 citations
1–8 of 75
CRO · 4 publications · 153 citations
4
h-index
3 publications · 49 citations
3
h-index
3 publications · 577 citations
3
h-index
3 publications · 1.1K citations
3
h-index
MCOM · 3 publications · 125 citations
3
h-index
1–5