Pages that link to "Item:Q1961455"
From MaRDI portal
The following pages link to Elliptic approximations of propositional formulae (Q1961455):
Displaying 4 items.
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- Solving satisfiability problems using elliptic approximations -- effective branching rules (Q1841892) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
