scientific article; zbMATH DE number 1361489
From MaRDI portal
Publication:4699307
Recommendations
Cited in
(18)- On finding short resolution refutations and small unsatisfiable subsets
- Computational aspects of infeasibility analysis in mixed integer programming
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
- Copy complexity of Horn formulas with respect to unit read-once resolution
- Density condensation of Boolean formulas
- Are Short Proofs Narrow? QBF Resolution is not Simple.
- scientific article; zbMATH DE number 1955763 (Why is no real title available?)
- scientific article; zbMATH DE number 1405672 (Why is no real title available?)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- Finding a tree structure in a resolution proof is NP-complete
- Andrews Skolemization may shorten resolution proofs non-elementarily
- Pool resolution is NP-hard to recognize
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
- Transformation rules for CNOT-based quantum circuits and their applications
- The NP-hardness of finding a directed acyclic graph for regular resolution
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
- Are Short Proofs Narrow? QBF Resolution Is Not So Simple
- Finding the hardest formulas for resolution
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699307)
