Exact algorithms for exact satisfiability and number of perfect matchings

Keyphrases

• Exact Algorithm 100%
• Perfect Matching 100%
• Exact Satisfiability 100%
• Set Cover 66%
• Polynomial Space 66%
• Problem-based 33%
• Inclusion-exclusion 33%
• Path Length 33%
• Hypergraph 33%
• Number of Solutions 33%
• Divide-and-conquer 33%
• Exponential Space 33%
• Minimum Dominating Set 33%
• Uniform Set 33%
• Clique Partitioning 33%
• Exponential-time Algorithms 33%
• Set Covering Problem 33%
• Chromatic number 33%
• Satisfiability Problem 33%
• Element Set 33%

Computer Science

• Exact Algorithm 100%
• Perfect Matchings 100%
• Polynomial Space 66%
• Space Exponential 33%
• Satisfiability Problem 33%
• Chromatic Number 33%

Mathematics

• Perfect Matchings 100%
• Polynomial 66%
• Running Time 66%
• Clique 33%
• Exponential Time 33%
• Dominating Set 33%
• Chromatic Number 33%