The following pages link to Parameterized proof complexity (Q451111):
Displayed 8 items.
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824) (← links)
- The complexity of proving that a graph is Ramsey (Q1705815) (← links)
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (Q1947040) (← links)
- Strong intractability results for generalized convex recoloring problems (Q2184691) (← links)
- Strong intractability of generalized convex recoloring problems (Q2413156) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)