Elliptic approximations of propositional formulae

DOI10.1016/S0166-218X(99)00041-4zbMath0941.68063OpenAlexW2050091725WikidataQ126527503 ScholiaQ126527503MaRDI QIDQ1961455

Hans van Maaren

Publication date: 17 January 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00041-4

zbMATH Keywords

concave quadratic function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (4)

Recognition of tractable satisfiability problems through balanced polynomial representations ⋮ An improved semidefinite programming relaxation for the satisfiability problem ⋮ Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT ⋮ Solving satisfiability problems using elliptic approximations -- effective branching rules

Cites Work

• Laplacian eigenvalues and the maximum cut problem
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Elliptic approximations of propositional formulae