Solving satisfiability problems using elliptic approximations -- effective branching rules
type: Item
instance of: scholarly article
title: Solving satisfiability problems using elliptic approximations -- effective branching rules
zbMATH Open document ID: 0965.68026
DOI: 10.1016/S0166-218X(00)00249-3
author: Joost P. Warners
author: Hans van Maaren
published in: Discrete Applied Mathematics
publication date: 2001-07-29T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1565928
zbMATH Keywords: elliptic approximation of 3SAT problems
describes a project that uses: DIMACS
MaRDI profile type: Publication
cites work: A fast parallel SAT-solver -- efficient workload balancing
cites work: The complexity of theorem-proving procedures
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Q5687266
cites work: Q5687274
cites work: Branching rules for satisfiability
cites work: Solving propositional satisfiability problems
cites work: Computational experience with an interior point algorithm on the satisfiability problem
cites work: Elliptic approximations of propositional formulae
cites work: Q4375779
cites work: Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
cites work: Solving satisfiability problems using elliptic approximations. A note on volumes and weights
cites work: Q3466118
cites work: A nonlinear approach to a class of combinatorial optimization problems
cites work: Recognition of tractable satisfiability problems through balanced polynomial representations
cites work: A potential reduction approach to the frequency assignment problem
description: scientific article; zbMATH DE number 1565928