Article
Licensed
Unlicensed
Requires Authentication
New upper bounds for the problem of maximal satisfiability
-
Published/Copyright:
May 28, 2009
Abstract
In this paper we present relatively simple proofs of the following new upper bounds:
cN, where c < 2 is a constant and N is the number of variables, for MAX-SAT for formulas with constant clause density;
2K/6, where K is the number of clauses, for MAX-2-SAT;
2N/6.7 for (n, 3)-MAX-2-SAT.
All bounds are proved by the splitting method. The main two techniques are combined complexity measures and clause learning.
Received: 2008-03-11
Published Online: 2009-05-28
Published in Print: 2009-May
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Reconstruction of automata by fragments of behaviour
- New upper bounds for the problem of maximal satisfiability
- Identities with permutations leading to linearity of quasigroups
- Critical branching random walks on low-dimensional lattices
- Limit theorems for the number of dense series in a random sequence
Articles in the same Issue
- Reconstruction of automata by fragments of behaviour
- New upper bounds for the problem of maximal satisfiability
- Identities with permutations leading to linearity of quasigroups
- Critical branching random walks on low-dimensional lattices
- Limit theorems for the number of dense series in a random sequence
