Arithmetic Formula Lower Bounds is a theoretical construct in circuit complexity that denotes a proven minimum on the size or depth of arithmetic formulas required to compute a specific polynomial family, thereby distinguishing the inherent computational hardness of that family from other problems within the same complexity class.
84
Publications
3.1K
Citations
113
Authors
68
Institutions
Publications per year
2017–2026
4
Parents
Publications
84
1–5 of 84
Authors
113
- RR
6
h-index
- NK
5
h-index
- AW
5
h-index
- AY
5
h-index
- NL
4
h-index
1–5 of 113
Institutions
68
Weizmann Institute of Science
Rehovot, Israel
5 h-index
7 publications
317 citations
Indian Institute of Science Bangalore
Bengaluru, India
4 h-index
4 publications
122 citations
Institute for Advanced Study
Princeton, United States
4 h-index
9 publications
160 citations
Microsoft Research (India)
Bengaluru, India
4 h-index
6 publications
189 citations
Indian Institute of Technology Bombay
Mumbai, India
3 h-index
6 publications
214 citations
University of Calgary
Calgary, Canada
2 h-index
4 publications
77 citations
Princeton University
Princeton, United States
2 h-index
3 publications
65 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
2 h-index
2 publications
36 citations
1–8 of 68
Venues
- SIAM Journal on Computing
9 publications · 251 citations
9
h-index
- Mathematics of Computation
MCOM · 4 publications · 89 citations
4
h-index
- Applicable Algebra in Engineering Communication and Computing
3 publications · 145 citations
3
h-index
- Theoretical Computer Science
3 publications · 56 citations
3
h-index
- IEEE Transactions on Circuits & Systems II Express Briefs
2 publications · 131 citations
2
h-index
1–5