A. and K. Fukuda, Reverse search for enumeration, Discrete Applied Mathematics, vol.65, issue.1, pp.21-46, 1996.

A. Kirby, A. F. Baker, and . Pixley, Polynomial interpolation and the chinese remainder theorem for algebraic systems, Mathematische Zeitschrift, vol.143, issue.2, pp.165-174, 1975.

A. Andrei, V. Bulatov, M. Dalmau, D. Grohe, and . Marx, Enumerating homomorphisms, Journal of Computer and System Sciences, vol.78, issue.2, pp.638-650, 2012.

F. Capelli, A. Durand, and Y. Strozecki, A note on polynomial delay and incremental delay Available on, 2015.

J. Creignou and . Hébrard, On generating all solutions of generalized satisfiability problems, RAIRO Theoretical Informatics and Applications, p.31, 1997.
DOI : 10.1051/ita/1997310604991

M. Flum and . Grohe, Parameterized complexity theory, 2006.

R. Garey and D. S. Johnson, Computers and intractability: a guide to NP-completeness, 1979.

D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

E. Khachiyan, K. Boros, V. Elbassioni, K. Gurvich, and . Makino, On the Complexity of Some Enumeration Problems for Matroids, SIAM Journal on Discrete Mathematics, vol.19, issue.4, pp.966-984, 2005.
DOI : 10.1137/S0895480103428338

E. Knuth, Combinatorial algorithms, part 1, volume 4a of the art of computer programming, 2011.

L. Emil and . Post, The two-valued iterative systems of mathematical logic, 1941.

R. Read and . Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, vol.5, issue.3, pp.237-252, 1975.

S. Reith and H. Vollmer, Optimal satisfiability for propositional calculi and constraint satisfaction problems, Information and Computation, vol.186, issue.1, pp.1-19, 2003.
DOI : 10.1016/S0890-5401(03)00092-0
URL : http://dx.doi.org/10.1016/s0890-5401(03)00092-0

J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, p.226, 1978.
DOI : 10.1145/800133.804350

. Strozecki, Enumeration complexity and matroid decomposition, 2010.

Y. Strozecki, On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation, Theory of Computing Systems, vol.9, issue.3, pp.532-568, 2013.
DOI : 10.1007/s00224-012-9442-z
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.703.1767