Sciweavers

APPROX
2010
Springer
297views Algorithms» more  APPROX 2010»
14 years 10 days ago
Approximating Linear Threshold Predicates
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
Mahdi Cheraghchi, Johan Håstad, Marcus Isaks...