Pages that link to "Item:Q1884991"
From MaRDI portal
The following pages link to Mutilated chessboard problem is exponentially hard for resolution (Q1884991):
Displaying 12 items.
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
- Preprocessing of propagation redundant clauses (Q2104502) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- (Q5092479) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Preprocessing of propagation redundant clauses (Q6053844) (← links)
