Pages that link to "Item:Q1977751"
From MaRDI portal
The following pages link to Relaxations of the satisfiability problem using semidefinite programming (Q1977751):
Displaying 13 items.
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Semidefinite relaxations of dynamical programs under discrete constraints (Q601981) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- On semidefinite programming relaxations of \((2+p)\)-SAT (Q1861907) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- On semidefinite programming relaxations for the satisfiability problem (Q2386349) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← 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)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- (Q3109951) (← links)
- (Q4667097) (← links)