Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Feasibly constructive proofs of succinct weak circuit lower bounds |
scientific article |
Statements
Feasibly constructive proofs of succinct weak circuit lower bounds (English)
0 references
22 November 2019
0 references
The article is well written and organized. Mainly, it shows the benefits of the succinct circuit lowe bound proof in \(APC_1\) by proving, in that theory, three mayor results, i.e., the switching lemma, Razborov-Smolensky's approximation method, and Razborov's method for monotone circuits. Beside, we like to mention that in the proofs the authors well point out which steps rely on \(sWPHP(PV)\), which we believe is not a minor detail. Page 7 Theorem 2.1, page 30 Remark 4.3, and page 34 last paragraph, present the same typo, which is, instead of Buss witnessing theorem must be Buss's witnessing theorem.
0 references
proof complexity
0 references
bounded arithmetic
0 references
circuit lower bounds
0 references
approximate counting
0 references
natural proofs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references