Finite Field Computation
Finite Field Computation is a computational method that operates within the algebraic structure of finite fields, distinguished by its restriction to arithmetic and algorithmic operations over a finite set of elements governed by specific field axioms.
897
Publications
35.2K
Citations
1.6K
Authors
690
Institutions
Publications per year
2017–2026
86
Parents
897
Discovering faster matrix multiplication algorithms with reinforcement learning
Alhussein Fawzi, Matej Balog, Aja Huang et al. · Nature · 2022 · 450 citations · Full text
The fast Fourier transform in a finite field
J. M. Pollard · Mathematics of Computation · 1971 · 415 citations
Marcel Keller, Emmanuela Orsini, Peter Schöll · 2016 · 364 citations · Full text
The Elementary Theory of Finite Fields
James Ax · Annals of Mathematics · 1968 · 346 citations
1–5 of 897
1.6K
12
h-index
12
h-index
11
h-index
10
h-index
10
h-index
1–5 of 1.6K
690

University of Waterloo
Waterloo, Canada
18 h-index
31 publications
2K citations

Centre National de la Recherche Scientifique
Paris, France
15 h-index
49 publications
1.3K citations

University of Toronto
Toronto, Canada
12 h-index
17 publications
564 citations

Pennsylvania State University
State College, United States
12 h-index
16 publications
362 citations
Austrian Academy of Sciences
Vienna, Austria
10 h-index
13 publications
340 citations

Carleton University
Ottawa, Canada
10 h-index
15 publications
290 citations
University of South Florida
Tampa, United States
10 h-index
15 publications
596 citations
University of Southern California
Los Angeles, United States
9 h-index
14 publications
1.3K citations
1–8 of 690
44 publications · 2.8K citations
28
h-index
56 publications · 1.8K citations
24
h-index
MCOM · 40 publications · 3K citations
21
h-index
25 publications · 1.4K citations
21
h-index
25 publications · 921 citations
18
h-index
1–5