Pages that link to "Item:Q2386349"
From MaRDI portal
The following pages link to On semidefinite programming relaxations for the satisfiability problem (Q2386349):
Displaying 6 items.
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← links)
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem (Q2454077) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
