18 search results - page 1 / 4 » On the Approximation Resistance of a Random Predicate |
APPROX
2007
Springer
15 years 26 days ago
2007
Springer
STOC
2009
ACM
15 years 7 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
COCO
2008
Springer
14 years 8 months ago
2008
Springer
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
LATIN
2010
Springer
14 years 5 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
CIT
2006
Springer
14 years 10 months ago
2006
Springer
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...