Pages that link to "Item:Q1861907"
From MaRDI portal
The following pages link to On semidefinite programming relaxations of \((2+p)\)-SAT (Q1861907):
Displaying 11 items.
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Relaxations of the satisfiability problem using semidefinite programming (Q1977751) (← links)
- On semidefinite programming relaxations for the satisfiability problem (Q2386349) (← 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)
- Relaxations of the satisfiability problem using semidefinite programming (Q2749859) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (Q3521946) (← links)
- Theory and Applications of Satisfiability Testing (Q5713720) (← links)