Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random".
Venkatesan GuruswamiPravesh K. KothariPeter ManoharPublished in: CoRR (2021)
Keyphrases
- orders of magnitude
- computational cost
- np complete
- computational complexity
- significant improvement
- optimization problems
- data structure
- special case
- np hard
- decomposition methods
- times faster
- constraint graph
- machine learning
- graph theory
- combinatorial optimization
- constraint satisfaction problems
- data mining techniques
- worst case