Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random.
Venkatesan GuruswamiPravesh K. KothariPeter ManoharPublished in: STOC (2022)
Keyphrases
- learning algorithm
- orders of magnitude
- theoretical analysis
- significant improvement
- np complete
- random instances
- data sets
- real valued
- times faster
- constraint satisfaction problems
- worst case
- data mining
- optimization problems
- np hard
- machine learning algorithms
- benchmark datasets
- computational complexity
- data structure
- reinforcement learning
- constraint problems