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

• Type: Journal
• Year: 2008
• Where: ALGORITHMICA
• Authors: Andreas Björklund, Thore Husfeldt
• Keywords: ALGORITHMICA 2008, Exact Algorithms, Exact Satisfiability Problem, Polynomial Space