Pages that link to "Item:Q1764155"
From MaRDI portal
The following pages link to Non-automatizability of bounded-depth Frege proofs (Q1764155):
Displaying 14 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Lifting lower bounds for tree-like proofs (Q475337) (← links)
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- The canonical pairs of bounded depth Frege systems (Q2216035) (← links)
- Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (Q3012837) (← links)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- A form of feasible interpolation for constant depth Frege systems (Q3570172) (← links)
- Short Proofs Are Hard to Find (Q5091243) (← links)
- Parity Games and Propositional Proofs (Q5169973) (← links)