Resolution refutations and propositional proofs with height-restrictions
From MaRDI portal
Recommendations
- On the relative complexity of resolution refinements and cutting planes proof systems
- Unrestricted resolution versus N-resolution
- Short proofs are narrow -- resolution made simple
- Short proofs are narrow—resolution made simple
- On the complexity of resolution with bounded conjunctions (extended abstract).
This page was built for publication: Resolution refutations and propositional proofs with height-restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411850)