Elliptic approximations of propositional formulae

Authors:
Hans van Maaren
Affiliations:
-
Venue:
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Year:
1999

Citing 0
Cited 4

Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights

Annals of Mathematics and Artificial Intelligence
On Semidefinite Programming Relaxations of (2+p)-SAT

Annals of Mathematics and Artificial Intelligence
Some interesting research directions in satisfiability

Annals of Mathematics and Artificial Intelligence
Relaxations of the Satisfiability Problem Using Semidefinite Programming

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract