1. Ansótegui, C., Bonet, M.L., Levy, J., Manyà, F.: Measuring the hardness of SAT instances. In: AAAI, pp. 222–228 (2008)
2. Bard, G.V.: Algebraic Cryptanalysis. Springer, USA (2009). https://doi.org/10.1007/978-0-387-88757-9
3. Bessière, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. In: IJCAI, pp. 412–418 (2009)
4. Lecture Notes in Computer Science;A Biere,1999
5. Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. FAIA, 2nd edn., vol. 336. IOS Press (2021)