Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson. Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Electronic Colloquium on Computational Complexity (ECCC), 23:98, 2016. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Proof Complexity Lower Bounds from Algebraic Circuit ComplexityMichael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson. coco 2016: [doi] Proof Complexity Lower Bounds from Algebraic Circuit ComplexityMichael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson. toc, 17:1-88, 2021. [doi]
The following publications are possibly variants of this publication: