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:
Electron. Colloquium Comput. Complex. (2011)
Keyphrases
</>
partial order
constraint satisfaction problems
random instances
artificial intelligence
partial ordering
information retrieval
social networks
bayesian networks
lower bound
approximation algorithms
multi valued
constraint solving
ordering heuristics