1. Ansótegui, C., Bonet, M., Giráldez-Cru, J., Levy, J., Simon, L.: Community structures in industrial SAT instances. J. Artif. Intell. Res. 66, 443–472 (2019)
2. Bellare, M., Goldwasser, S.: The complexity of decision versus search. SIAM J. Comput. 23(1), 97–119 (1994)
3. Berman, P.: Relationship between density and deterministic complexity of NP-complete languages. In: Proceedings of the 5th International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, July 1978, vol. 62, pp. 63–71. Springer (1978)
4. Borodin, A., Demers, A.: Some comments on functional self-reducibility and the NP hierarchy. Technical Report TR 76-284, Department of Computer Science, Cornell University, Ithaca, NY, July (1976)
5. Buhrman, H., Hitchcock, J.: NP-hard sets are exponentially dense unless coNP$$\,\subseteq \,$$NP/poly. In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, June 2008, pp. 1–7. IEEE Computer Society Press (2008)