We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....