no code implementations • ICLR 2019 • Yu Wang, Fengjuan Gao, Amin Alipour, Linzhang Wang, Xuandong Li, Zhendong Su
Boolean satisfiability (SAT) is one of the most well-known NP-complete problems and has been extensively studied.
