37 search results - page 8 / 8 » The Exact Closest String Problem as a Constraint Satisfactio... |
SODA
2010
ACM
13 years 9 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
TCC
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...