NLocalSAT: Boosting Local Search with Solution Prediction

26 Jan 2020 Wenjie Zhang Zeyu Sun Qihao Zhu Ge Li Shaowei Cai Yingfei Xiong Lu Zhang

The Boolean satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective way for solving a satisfiable SAT problem is the stochastic local search (SLS)... (read more)

PDF Abstract

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet