The following pages link to (Q2749859):
Displaying 4 items.
- Approximating minimal unsatisfiable subformulae by means of adaptive core search (Q1408373) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- A complete adaptive algorithm for propositional satisfiability (Q1811072) (← links)
- The state of SAT (Q2643296) (← links)
