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