Pages that link to "Item:Q1774165"
From MaRDI portal
The following pages link to An improved semidefinite programming relaxation for the satisfiability problem (Q1774165):
Displaying 5 items.
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
