Pages that link to "Item:Q5501187"
From MaRDI portal
The following pages link to Resolution lower bounds for the weak pigeonhole principle (Q5501187):
Displaying 13 items.
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Width versus size in resolution proofs (Q2382288) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- Satisfiability via Smooth Pictures (Q2817998) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← 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)
- LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE (Q5501765) (← links)
- Propositional proof complexity (Q6064569) (← links)
