#3-Regular bipartite planar vertex cover is #p-complete

Authors:
Mingji Xia;Wenbo Zhao
Affiliations:
Institute of Software, Chinese Academy of Sciences, Beijing, China;Graduate University of Chinese Academy of Sciences, Beijing, China
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 5
Cited 3

The Complexity of Planar Counting Problems

SIAM Journal on Computing
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

Computational Complexity
The Complexity of Counting in Sparse, Regular, and Planar Graphs

SIAM Journal on Computing
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes

Theoretical Computer Science
Holographic Algorithms (Extended Abstract)

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science

Planarity, Determinants, Permanents, and (Unique) Matchings

ACM Transactions on Computation Theory (TOCT)
Maximum edge-disjoint paths problem in planar graphs

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Planarity, determinants, permanents, and (unique) matchings

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We generalize the polynomial interpolation method by giving a sufficient condition, which guarantees that the coefficients of a polynomial are uniquely determined by its values on a recurrence sequence. Using this method, we show that #3-Regular Bipartite Planar Vertex Cover is #P-complete. The result is unexpected, since the same question for 2-regular graph is in FP.