537 search results - page 7 / 108 » A new upper bound for 3-SAT |
BMCBI
2006
13 years 8 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
JCT
2000
13 years 8 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)
AAAI
2006
13 years 9 months ago
2006
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance ...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
CORR
2011
Springer
13 years 3 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...