A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Approximating Linear Threshold Predicates
[chapter]
2010
Lecture Notes in Computer Science
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 + · · · + wnxn) for some positive integer weights w1, . . . , wn. Despite their simplicity, current techniques fall short of providing a classification of these predicates in terms of approximability. In fact, it is not easy to guess whether there exists a homogeneous linear threshold predicate that is approximation
doi:10.1007/978-3-642-15369-3_9
fatcat:xibuyeq3ord4rbagno3sxnalne