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.
This is part of the first author’s Ph.D. thesis. Both authors are grateful to their supervisor Prof. Angsheng Li for advice and encouragement. Both authors are supported by NSFC Grant no. 60325206 and no. 60310213.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Stearns, R.E.: The Complexity of Planar Counting Problems. SIAM J. Comput. 27, 1142–1167 (1998)
Liskiewicz, M., Ogihara, M., Toda, S.: The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 304, 129–156 (2003)
Greenhill, C.S.: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity 9, 52–72 (2000)
Papadimitriou, C.: Computational Complexity. Addison–Wesley, Reading (1994)
Vadhan, S.P.: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing 31, 398–427 (2001)
Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8, 410–421 (1979)
Valiant, L.G.: Holographic Algorithms (Extended Abstract). In: FOCS, pp. 306–315 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xia, M., Zhao, W. (2006). #3-Regular Bipartite Planar Vertex Cover is #P-Complete. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_34
Download citation
DOI: https://doi.org/10.1007/11750321_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)