Abstract

We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in very restricted classes of graphs. In particular, it is shown that the problems of counting matchings, vertex covers, independent sets, and extremal variants of these all remain hard when restricted to planar bipartite graphs of bounded degree or regular graphs of constant degree. To achieve these results, a new interpolationbased reduction technique which preserves properties such as constant degree is introduced. In addition, the problem of approximately counting minimum cardinality vertex covers is shown to remain NP-hard even when restricted to graphs of maximal degree 3. Previously, restrictedcase complexity results for counting problems were elusive; we believe our techniques may help obtain similar results for many other counting problems. 1 Introduction Ever since the introduction of NP-completeness in the early 1970's, the primary focus of complexity theory has been on decision ...

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
1950	Computational complexity - Papadimitriou - 1994
432	A classical introduction to modern number theory. 2nd ed - Ireland, Rosen - 1990
409	The complexity of computing the permanent - Valiant - 1979
334	The complexity of enumeration and reliability problems - Valiant - 1979
257	Approximating the Permanent - Jerrum, Sinclair - 1989
253	A PolynomialTime Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries - Jerrum, Sinclair, et al.
250	Random Generation of Combinatorial Structures from a Uniform Distributions, Theoret. Computer Sci - Jerrum, Valiant, et al. - 1986
216	Approximate counting, uniform generation and rapidly mixing Markov chains - Sinclair, Jerrum - 1989
178	On the hardness of approximate reasoning - Roth - 1996
166	Algorithms for Random Generation and Counting: A Markov Chain Approach, Birkhäuser - Sinclair - 1993
100	The complexity of counting cuts and of computing the probability that a graph is connected - Provan, Ball - 1983
88	On the computational complexity of the Jones and Tutte polynomials - Jaeger, Vertigan, et al. - 1990
67	statistics and phase transition - Kasteleyn
59	Dimer problem in statistical mechanics c an exact result - Temperley, Fisher - 1961
58	Frieze A: On the complexity of computing the volume of a polyhedron - Dyer - 1988
48	Markov chains and polynomial time algorithms - Kannan - 1994
39	Counting linear extensions is #P-complete - Birghtwell, Winkler - 1991
34	Two-dimensional monomer-dimer systems are computationally intractable - Jerrum - 1987
28	enumeration problems in geometry and combinatorics - Hard - 1986
27	Statistical mechanics of dimers on a plane lattice - Fisher - 1961
22	Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT - Bubley, Dyer - 1997
21	Approximating the permanent of graphs with large factors - Dagum, Luby - 1992
17	On the number of Eulerian orientations of a graph - Mihail, Winkler - 1992
14	On solutions of x d = 1 in symmetric groups - Moser, Wyman - 1955
10	Eric Vigoda. Approximately counting up to four (extended abstract - Luby - 1997
8	Automating Polya theory: The computational complexity of the cycle index polynomial - Goldberg - 1993
5	editor: Graph Theory and Theoretical - Harary - 1967
2	On the closure properties of #P - Ogihara, Thierauf, et al. - 1996
1	The complexity of counting. Undergraduate thesis - Vadhan - 1995