The following pages link to Automating Resolution is NP-Hard (Q5133983):
Displaying 18 items.
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- Resolution remains hard under equivalence (Q1961451) (← links)
- 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)
- Regular resolution effectively simulates resolution (Q6551714) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
- On computing small variable disjunction branch-and-bound trees (Q6589747) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
