110 search results - page 3 / 22 » New Upper Bounds for Maximum Satisfiability |
SACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
It has recently been shown that when m > 1 2 n - 1, the nonlinearity Nf of an mth-order correlation immune function f with n variables satisfies the condition of Nf 2n-1 - 2m ,...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
AI
2005
Springer
13 years 5 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
SODA
2000
ACM
13 years 7 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
SAT
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...