Proof Complexity Lower Bounds from Algebraic Circuit Complexity

Research output: Chapter in Book/Report/Conference proceeding › Other contribution

Keywords

@inbook{925b4856b7da475a97e5688d136abed5,

title = "Proof Complexity Lower Bounds from Algebraic Circuit Complexity",

keywords = "complexity theory, algebraic complexity",

author = "Michael Forbes and Amir Shpilka and Iddo Tzameret and Avi Wigderson",

year = "2017",

month = oct,

day = "1",

doi = "10.4086/toc.2017.v013a001",

language = "English",

pages = "1",

booktitle = "Theory of Computation (ToC)",

}

TY - CHAP

T1 - Proof Complexity Lower Bounds from Algebraic Circuit Complexity

AU - Forbes, Michael

AU - Shpilka, Amir

AU - Tzameret, Iddo

AU - Wigderson, Avi

PY - 2017/10/1

Y1 - 2017/10/1

KW - complexity theory

KW - algebraic complexity

U2 - 10.4086/toc.2017.v013a001

DO - 10.4086/toc.2017.v013a001

M3 - Other contribution

SP - 1

BT - Theory of Computation (ToC)

ER -