Login / Signup
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant.
Venkatesan Guruswami
Johan Håstad
Rajsekar Manokaran
Prasad Raghavendra
Moses Charikar
Published in:
SIAM J. Comput. (2011)
Keyphrases
</>
constraint satisfaction problems
randomly generated
ordering heuristics
constraint satisfaction
artificial intelligence
website
bayesian networks
search algorithm
partial order
multi valued
approximation methods
partial ordering
random instances