A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs.

Pasin Manurangsi Prasad Raghavendra

Published in: CoRR (2016)

Keyphrases

constraint satisfaction problems
data sets
computational complexity
computational cost
worst case
constraint propagation
search engine
search space
upper bound
constraint satisfaction
space complexity