539 search results - page 8 / 108 » An Improved Upper Bound for SAT |
DAM
2008
13 years 7 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
IPL
2010
13 years 6 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
DAC
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we propose a novel technique on mining relationships in a sequential circuit to discover global constraints. In contrast to the traditional learning methods, our mi...
AMAI
2004
Springer
14 years 26 days ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...