The following publications are possibly variants of this publication:
- Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret. stoc 2020: 54-67 [doi]
- Exponential Lower Bound for Static Semi-algebraic ProofsDima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik. icalp 2002: 257-268 [doi]
- 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. eccc, 23:98, 2016. [doi]
- Proof Complexity Lower Bounds from Algebraic Circuit ComplexityMichael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson. toc, 17:1-88, 2021. [doi]