Elliptic approximations of propositional formulae
From MaRDI portal
Recommendations
- Solving satisfiability problems using elliptic approximations -- effective branching rules
- Solving satisfiability problems using elliptic approximations. A note on volumes and weights
- scientific article; zbMATH DE number 1114011
- scientific article; zbMATH DE number 1336257
- scientific article; zbMATH DE number 1303558
Cites work
- scientific article; zbMATH DE number 1113992 (Why is no real title available?)
- scientific article; zbMATH DE number 1114011 (Why is no real title available?)
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Laplacian eigenvalues and the maximum cut problem
Cited in
(7)- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
- An improved semidefinite programming relaxation for the satisfiability problem
- Solving satisfiability problems using elliptic approximations -- effective branching rules
- Solving satisfiability problems using elliptic approximations. A note on volumes and weights
- Recognition of tractable satisfiability problems through balanced polynomial representations
- The universe of propositional approximations
- Producing proofs from an arithmetic decision procedure in elliptical LF
This page was built for publication: Elliptic approximations of propositional formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961455)