Given a set N with n elements and a family F of subsets, we show how to partition N into k such subsets in 2nnO(1) time. We also consider variations of this problem where the subsets may overlap or… (More)

We present a fast algorithm for the subset convolution problem:given functions <i>f</i> and <i>g</i> defined on the lattice of subsets of an<i>n</i>-element set <i>n</i>, compute their subset… (More)

We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion–exclusion characterizations. We show that the… (More)

2006 47th Annual IEEE Symposium on Foundations of…

2006

Given a set U with n elements and a family of subsets S sube 2 <sup>U</sup> we show how to count the number of k-partitions S<sub>1 </sub> cup ... cup S<sub>k</sub> = U into subsets S<sub>i</sub>… (More)

We show that there is a polynomial space algorithm that counts the number of perfect matchings in an n-vertex graph in O(2) ⊂ O(1.415) time. (O∗(f(n)) suppresses functions polylogarithmic in… (More)

We show that the traveling salesman problem in bounded-degree graphs can be solved in time <i>O</i>((2-ε)<i><sup>n</sup></i>), where ε > 0 depends only on the degree bound but not on the number of… (More)

Given an undirected graph and two pairs of vertices (si, ti) for i ∈ {1, 2} we show that there is a polynomial time Monte Carlo algorithm that finds disjoint paths of smallest total length joining si… (More)

System level fault diagnosis deals with the problem of identifying component failures in a multiprocessor system. Each processor is either faulty or fault-free, and the objective is to find out the… (More)