The following pages link to (Q4699307):
Displaying 12 items.
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Density condensation of Boolean formulas (Q860385) (← links)
- The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- Pool resolution is NP-hard to recognize (Q1042441) (← links)
- Transformation rules for CNOT-based quantum circuits and their applications (Q1880336) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363) (← links)
- Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
