Recognition of tractable satisfiability problems through balanced polynomial representations

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

Relaxations of the Satisfiability Problem Using Semidefinite Programming

Journal of Automated Reasoning

The Taming of the (X)OR

CL '00 Proceedings of the First International Conference on Computational Logic

Efficient SAT solving: beyond supercubes

Proceedings of the 42nd annual Design Automation Conference

B-Cubing: New Possibilities for Efficient SAT-Solving

IEEE Transactions on Computers

Efficiently exploiting dependencies in local search for SAT

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3

A two-phase algorithm for solving a class of hard satisfiability problemsfn1fn1Supported by the Dutch Organization for Scientific Research (NWO) under grant SION 612-33-001.

Operations Research Letters