The following pages link to (Q4539605):
Displaying 15 items.
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- On the parametrized complexity of Read-once refutations in UTVPI+ constraint systems (Q2049975) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations (Q2095546) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
- Proving the infeasibility of Horn formulas through read-once resolution (Q6558679) (← links)
- Constrained read-once refutations in UTVPI constraint systems: a parallel perspective (Q6620016) (← links)
