Arithmetic Circuit Complexity
Arithmetic Circuit Complexity is a branch of computational complexity theory that studies the minimum number of arithmetic operations required to compute a given polynomial using directed acyclic graphs composed of gates representing field additions and multiplications, distinguished from Boolean circuit complexity by its focus on algebraic computations over infinite fields.
370
Publications
19.8K
Citations
573
Authors
277
Institutions
Publications per year
2017–2026
38
Variants
Algebraic Circuit Complexity
370
1–5 of 370
573
10
h-index
9
h-index
9
h-index
8
h-index
8
h-index
1–5 of 573
277

Linköping University
Linköping, Sweden
15 h-index
36 publications
1.3K citations

University of Waterloo
Waterloo, Canada
12 h-index
23 publications
1.7K citations
Microsoft (United States)
Redmond, United States
9 h-index
20 publications
834 citations

Concordia University
Montreal, Canada
8 h-index
21 publications
478 citations
Technion – Israel Institute of Technology
Haifa, Israel
8 h-index
11 publications
1.1K citations

Centre National de la Recherche Scientifique
Paris, France
8 h-index
15 publications
317 citations

Weizmann Institute of Science
Rehovot, Israel
8 h-index
10 publications
479 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
8 h-index
12 publications
418 citations
1–8 of 277
37 publications · 2.6K citations
23
h-index
21 publications · 1.4K citations
20
h-index
JACM · 8 publications · 513 citations
8
h-index
8 publications · 348 citations
8
h-index
Repository · 8 publications · 175 citations
8
h-index
1–5