Sciweavers

COCO
2008
Springer
74views Algorithms» more  COCO 2008»
14 years 1 months ago
Approximation Resistant Predicates from Pairwise Independence
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...
Per Austrin, Elchanan Mossel