Pages that link to "Item:Q1881260"
From MaRDI portal
The following pages link to Resolution lower bounds for perfect matching principles (Q1881260):
Displaying 14 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
- Resolution lower bounds for the weak functional pigeonhole principle. (Q1401365) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Width versus size in resolution proofs (Q2382288) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- (Q5092479) (← links)
- An Introduction to Lower Bounds on Resolution Proof Systems (Q5135261) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- Propositional proof complexity (Q6064569) (← links)
