Articles under category:
Proof Complexity
Proof Complexity
|
Vol 21, Article 6 (pp 1-29)
Polynomial Calculus Space and Resolution Width by Nicola Galesi, Leszek A. Kołodziejczyk, and Neil Thapen |
|
Vol 21, Article 4 (pp 1-48)
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds by Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals |
|
Vol 17, Article 10 (pp 1-88)
[CCC16 Spec Issue]
Proof Complexity Lower Bounds from Algebraic Circuit Complexity by Michael A. Forbes, Amir Shpilka, Iddo Tzameret, and Avi Wigderson |
|
Vol 16, Article 13 (pp 1-30)
Monotone Circuit Lower Bounds from Resolution by Ankit Garg, Mika Göös, Pritish Kamath, and Dmitry Sokolov |
|
Vol 12, Article 5 (pp 1-14)
A Tradeoff Between Length and Width in Resolution by Neil Thapen |
|
Vol 9, Article 14 (pp 471-557)
Towards an Optimal Separation of Space and Length in Resolution by Jakob Nordström and Johan Håstad |
|
Vol 3, Article 5 (pp 81-102)
An Exponential Separation between Regular and General Resolution by Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, and Alasdair Urquhart |
|
Vol 3, Article 2 (pp 25-43)
Easily refutable subformulas of large random 3CNF formulas by Uriel Feige and Eran Ofek |
|
Vol 2, Article 4 (pp 65-90)
Rank Bounds and Integrality Gaps for Cutting Planes Procedures by Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, and Toniann Pitassi |