Pages that link to "Item:Q2386349"
From MaRDI portal
The following pages link to On semidefinite programming relaxations for the satisfiability problem (Q2386349):
Displaying 15 items.
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Semidefinite relaxations of dynamical programs under discrete constraints (Q601981) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- On the complexity of semidefinite programs (Q1361073) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- On semidefinite programming relaxations of \((2+p)\)-SAT (Q1861907) (← links)
- Relaxations of the satisfiability problem using semidefinite programming (Q1977751) (← 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)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- Relaxations of the satisfiability problem using semidefinite programming (Q2749859) (← links)
- (Q3109951) (← links)
- (Q4667097) (← links)