Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
Fast Exponential-Time Algorithms to solve NP-complete ... - Lita
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
0/52<strong>Fast</strong> <strong>Exponential</strong>-<strong>Time</strong> <strong>Algorithms</strong>Inclusion ExclusionBjörklund-Husfeldt-Koivis<strong>to</strong> AlgorithmU set of size nS family of subsets of U, enumerable in time O ∗ (2 n )S[X ] = {S ∈ S : S ∩ X = ∅}s[X ] = |S[X ]|S (i) = {S ∈ S : |S| = i} subfamily of i-setss (i) [X ] = |S (i) [X ]| number of i-sets avoiding X
Change language