543 search results - page 8 / 109 » New Upper Bounds for MaxSat |
JCT
2000
14 years 9 months ago
2000
![An Upper Bound for B2[2] Sequences](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "An Upper Bound for B2[2] Sequences")
Abstract. We introduce a new counting method to deal with B2[2] sequences, getting a new upper bound for the size of these sequences, F(N, 2)
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discrimina...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman’s Lemma. This leads to tight multiply-recursive upper bounds that re...
COCOON
2004
Springer
15 years 3 months ago
2004
Springer
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
CORR
2004
Springer
14 years 9 months ago
2004
Springer
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...