Without loss of satisfaction
From MaRDI portal
Cites work
- R(4, 5) = 25
- A SAT attack on the Erdős discrepancy conjecture
- Combinatorial Relations and Chromatic Graphs
- DRAT and propagation redundancy proofs without new variables
- Dynamic Symmetry Breaking by Simulating Zykov Contraction
- Expressing symmetry breaking in DRAT proofs
- Hard examples for resolution
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- Mutilated chessboard problem is exponentially hard for resolution
- Mycielski graphs and PR proofs
- On a generalization of extended resolution
- On the Ramsey numbers R(3,8) and R(3,9)
- Short proofs without new variables
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Strong extension-free proof systems
- Super-blocked clauses
- The complexity of theorem-proving procedures
- The intractability of resolution
- The resolution of Keller's conjecture
This page was built for publication: Without loss of satisfaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605336)