1. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)
2. Lecture Notes in Computer Science;G Bagan,2007
3. Brault-Baron, J.: De la pertinence de l’énumération : complexité en logiques propositionnelle et du premier ordre. (The relevance of the list: propositional logic and complexity of the first order). Ph.D. thesis, University of Caen Normandy, France (2013). https://tel.archives-ouvertes.fr/tel-01081392
4. Creignou, N., Hébrard, J.J.: On generating all solutions of generalized satisfiability problems. Informatique Théorique et Applications 31(6), 499–511 (1997)
5. Creignou, N., Kröll, M., Pichler, R., Skritek, S., Vollmer, H.: On the complexity of hard enumeration problems. CoRR abs/1610.05493 (2016), http://arxiv.org/abs/1610.05493