A. Björklund and T. Husfeldt, Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings, Algorithmica, vol.348, issue.1???2, pp.226-249, 2008.
DOI : 10.1007/s00453-007-9149-8

A. Björklund, T. Husfeldt, and M. Koivisto, Set Partitioning via Inclusion-Exclusion, SIAM Journal on Computing, vol.39, issue.2, pp.546-563, 2009.
DOI : 10.1137/070683933

J. R. Bunch and J. E. Hopcroft, Triangular factorization and inversion by fast matrix multiplication, Mathematics of Computation, vol.28, issue.125, p.231236, 1974.
DOI : 10.1090/S0025-5718-1974-0331751-8

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.251-280, 1990.
DOI : 10.1145/28395.28396

URL : http://doi.org/10.1016/s0747-7171(08)80013-2

J. Edmonds, Systems of distinct representatives and linear algebra, Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, vol.71, issue.4, pp.241-245, 1967.
DOI : 10.6028/jres.071B.033

R. Karp, Reducibility Among Combinatorial Problems Complexity of Computer Computations, pp.85-103, 1972.

D. E. Knuth, Dancing Links, 2000.

M. Koivisto, Partitioning into Sets of Bounded Cardinality, Proceedings of the 7th IWPEC, 2009.
DOI : 10.1007/978-3-642-11269-0_21

I. Koutis, Faster Algebraic Algorithms for Path and Packing Problems, pp.575-586, 2008.
DOI : 10.1007/978-3-540-70575-8_47

L. Lovász, On determinants, matchings and random algorithms. Fundamentals of Computing Theory, 1979.

R. Motwani and P. Raghavan, Randomized algorithms, 1995.

W. T. Tutte, The Factorization of Linear Graphs, Journal of the London Mathematical Society, vol.1, issue.2, pp.107-111, 1947.
DOI : 10.1112/jlms/s1-22.2.107

L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, vol.8, issue.2, pp.189-201, 1979.
DOI : 10.1016/0304-3975(79)90044-6

R. Williams, Finding paths of length k in time, Information Processing Letters, vol.109, issue.6, pp.315-318, 2009.
DOI : 10.1016/j.ipl.2008.11.004