Exact covers via determinants

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 95-106

  Björklund, Andreas ^a  

^a NONE

Author keywords

Exact set cover; K Dimensional Matching; Moderately exponential time algorithms

Indexed keywords

DISJOINT COLLECTIONS; INCLUSION-EXCLUSION; K-DIMENSIONAL MATCHING; MATCHING PROBLEMS; MODERATELY EXPONENTIAL TIME ALGORITHMS; PERFECT MATCHINGS; POLYNOMIAL SPACE; SET COVER;

COMPUTER SCIENCE; POLYNOMIALS;

ALGORITHMS;

EID: 84880264218     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2447     Document Type: Conference Paper

References (15)

1. A. Björklund and T. Husfeldt. Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. Algorithmica 52(2): 226-249, 2008.
2. A. Björklund, T. Husfeldt, and M. Koivisto. Set Partitioning via inclusion-exclusion. SIAM Journal on Computing Vol.39, No.2: 546-563, 2009.
3. J. R. Bunch and J. E. Hopcroft. Triangular factorization and inversion by fast matrix multiplication, Mathematics of Computation, 28: 231-236, 1974.
4. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
5. J. Edmonds. Systems of distinct representatives and linear algebra. Journal of Research of the Natural Bureau of Standards, 71B, 4:241-245, 1967.
6. R. Karp. Reducibility Among Combinatorial Problems. Complexity of Computer Computations. New York: Plenum. pp. 85-103, 1972.
7. D. E. Knuth. Dancing Links, arXiv: cs/0011047, 2000.
8. M. Koivisto. Partitioning into Sets of Bounded Cardinality. Proceedings of the 7th IWPEC, 2009.
9. I. Koutis. Faster Algebraic Algorithms for Path and Packing Problems. 35th ICALP, pp. 575-586, 2008.
10. L. Lovász. On determinants, matchings and random algorithms. Fundamentals of Computing Theory. Akademia-Verlag, Berlin, 1979.
11. R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.
12. H. J. Ryser. Combinatorial Mathematics. Carus Math. Monographs, no. 14. Math. Assoc. of America, Washington, DC, 1963.
13. W. T. Tutte. The factorization of linear graphs. Journal of the London Mathematical Society, 22:107-111, 1947.
14. L. G. Valiant. The Complexity of Computing the Permanent. Theor. Comput. Sci. 8: 189-201, 1979.
15. k) Time. Information Processing Letters 109(6):315-318, 2009.