Login / Signup
Every 2-CSP allows nontrivial approximation.
Johan Håstad
Published in:
STOC (2005)
Keyphrases
</>
constraint satisfaction problems
np complete
constraint satisfaction
error bounds
decomposition methods
arc consistency
constraint programming
constraint propagation
efficient computation
closed form
real time
website
queueing networks
relative error
approximation error
continuous functions
neural network