Pages that link to "Item:Q1374208"
From MaRDI portal
The following pages link to Simplified lower bounds for propositional proofs (Q1374208):
Displaying 12 items.
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Random resolution refutations (Q2311546) (← links)
- LA, permutations, and the Hajós calculus (Q2581274) (← links)
- Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
- An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle (Q4847394) (← links)
- A Logical Autobiography (Q5027230) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Boolean functions on $S_n$ which are nearly linear (Q5028493) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- Iterated lower bound formulas: a diagonalization-based approach to proof complexity (Q6086997) (← links)
- On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems (Q6649455) (← links)