110 search results - page 1 / 22 » New Upper Bounds for Maximum Satisfiability |
JAL
2000
13 years 4 months ago
2000
The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
ICALP
1999
Springer
13 years 9 months ago
1999
Springer
We describe exact algorithms that provide new upper bounds for the Maximum Satisfiability problem (MaxSat). We prove
BMCBI
2006
13 years 4 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...