Limits and Applications of Group Algebras for Parameterized Problems

The algebraic framework introduced in [Koutis, Proc. of the 35 th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multilinear degree-k monomials in polynomials presented as circuits. The best known (randomized) algorithm for this problem requires only O *(2 k ) time and oracle access to an arithmetic circuit, i.e. the ability to evaluate the circuit on elements from a suitable group algebra. This algorithm has been used to obtain the best known algorithms for several parameterized problems. In this paper we use communication complexity to show that the O *(2 k ) algorithm is essentially optimal within this evaluation oracle framework. On the positive side, we give new applications of the method: finding a copy of a given tree on k nodes, a spanning tree with at least k leaves, a minimum set of nodes that dominate at least t nodes, and an m -dimensional k -matching. In each case we achieve a faster algorithm than what was known. We also apply the algebraic method to problems in exact counting. Among other results, we show that a combination of dynamic programming and a variation of the algebraic method can break the trivial upper bounds for exact parameterized counting in fairly general settings.

[1]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[2]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[3]  Joachim Kneis,et al.  Partial vs. Complete Domination: t-Dominating Set , 2007, SOFSEM.

[4]  Joachim Kneis,et al.  A New Algorithm for Finding Trees with Many Leaves , 2008, ISAAC.

[5]  Jianer Chen,et al.  Improved algorithms for path, matching, and packing problems , 2007, SODA '07.

[6]  D. Aldous.  Minimization Algorithms and Random Walk on the $d$-Cube , 1983 .

[7]  Michael R. Fellows,et al.  On Problems without Polynomial Kernels (Extended Abstract) , 2008, ICALP.

[8]  Noga Alon,et al.  Color-coding , 1995, JACM.

[9]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[10]  Santosh S. Vempala,et al.  Dispersion of Mass and the Complexity of Randomized Geometric Algorithms , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[11]  Tsutomu Kawabata,et al.  On Complexity of Computing the Permanent of a Rectangular Matrix (Special Section on Discrete Mathematics and Its Applications) , 1999 .

[12]  Joachim Kneis,et al.  Divide-and-Color , 2006, WG.

[13]  Eyal Kushilevitz,et al.  Communication Complexity: Index of Notation , 1996 .

[14]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[15]  Ryan Williams,et al.  Finding paths of length k in O*(2k) time , 2008, Inf. Process. Lett..

[16]  Ioannis Koutis.  A faster parameterized algorithm for set packing , 2005, Inf. Process. Lett..

[17]  György Elekes,et al.  A geometric inequality and the complexity of computing volume , 1986, Discret. Comput. Geom..

[18]  Ioannis Koutis,et al.  Faster Algebraic Algorithms for Path and Packing Problems , 2008, ICALP.

[19]  Ryan Williams,et al.  Finding, minimizing, and counting weighted subgraphs , 2009, STOC '09.

[20]  Andreas Björklund,et al.  The fast intersection transform with applications to counting paths , 2008, ArXiv.