1. SAT competition. The International SAT Competition Web Page (2002–2024). http://www.satcompetition.org/
2. Abe, K., Xu, Z., Sato, I., Sugiyama, M.: Solving NP-hard problems on graphs by reinforcement learning without domain knowledge. arXiv preprint arXiv:1905.11623, pp. 1–24 (2019)
3. Agostinelli, F., McAleer, S., Shmakov, A., Baldi, P.: Solving the Rubik’s cube with deep reinforcement learning and search. Nat. Mach. Intell. 1(8), 356–363 (2019)
4. Balcan, M.: Data-driven algorithm design. CoRR abs/2011.07177 (2020). https://arxiv.org/abs/2011.07177
5. Lecture Notes in Computer Science;P Baudiš,2012