The Proof Complexity of Arithmetic Circuits is a theoretical framework within computational complexity theory that measures the minimal resources required for algebraic proof systems to verify identities over arithmetic circuits, distinguishing itself by focusing on the interplay between circuit structure and the complexity of proofs in algebraic reasoning.
6
Publications
363
Citations
15
Authors
10
Institutions
Publications per year
2017–2026
1
Parents
Publications
6
Short Proofs for the Determinant Identities
Pavel Hrubeš, Iddo Tzameret · SIAM Journal on Computing · 2015 · 43 citations
1–5 of 6
Authors
15
- NG
1
h-index
- AD
1
h-index
- RI
1
h-index
- JL
1
h-index
- AB
1
h-index
1–5 of 15
Institutions
10
University of California San Diego
San Diego, United States
2 h-index
3 publications
272 citations
Steklov Mathematical Institute
Moscow, Russia
1 h-index
1 publications
118 citations
University of Birmingham
Birmingham, United Kingdom
1 h-index
1 publications
21 citations
Czech Academy of Sciences
Prague, Czechia
1 h-index
2 publications
236 citations
University of Washington
Seattle, United States
1 h-index
1 publications
43 citations
Ben-Gurion University of the Negev
Beersheba, Israel
1 h-index
2 publications
52 citations
Czech Academy of Sciences, Institute of Mathematics
Prague, Czechia
1 h-index
2 publications
236 citations
Wisdom Health (United States)
Vancouver, United States
1 h-index
1 publications
21 citations
1–8 of 10
Venues
- SIAM Journal on Computing
3 publications · 188 citations
3
h-index
- Annals of Pure and Applied Logic
1 publications · 36 citations
1
h-index
- University of Birmingham Research Portal (University of Birmingham)
Repository · 1 publications · 21 citations
1
h-index
- Computational Complexity
CC · 1 publications · 118 citations
1
h-index
1–4