The following pages link to Automating Resolution is NP-Hard (Q5133983):
Displaying 8 items.
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Theorem proving as constraint solving with coherent logic (Q2102932) (← links)
- Large clique is hard on average for resolution (Q2117104) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- The canonical pairs of bounded depth Frege systems (Q2216035) (← links)
- (Q5028438) (← links)
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067) (← links)
- Propositional proof complexity (Q6064569) (← links)
