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

@article{Maaren2003SolvingSP, title={Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights}, author={Hans van Maaren and Joost P. Warners}, journal={Annals of Mathematics and Artificial Intelligence}, year={2003}, volume={37}, pages={273-283} }

- Published 2003 in Annals of Mathematics and Artificial Intelligence
DOI:10.1023/A:1021200130191

In this note we propose to use the volume of elliptic approximations of satisfiability problems as a measure for computing weighting coefficients of clauses of different lengths. For random 3-SAT formula it is confirmed experimentally that, when applied in a DPLL algorithm with a branching strategy that is based on the ellipsoids as well, the weight deduced yields better results than the weights that are used in previous studies.