Sciweavers

ALGORITHMICA
2008
88views more  ALGORITHMICA 2008»
13 years 5 months ago
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
Andreas Björklund, Thore Husfeldt