Computational complexity of counting problems on 3-regular planar graphs

Theoretical Computer Science

Volumn 384, Issue 1, 2007, Pages 111-125

  Xia, Mingji ^a,b   Zhang, Peng ^a,b   Zhao, Wenbo ^a,b  

^a INSTITUTE OF SOFTWARE   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

P completeness; Holographic reduction; Matching; Vertex cover

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

HOLANT THEOREMS; HOLOGRAPHIC REDUCTION; TERNARY SYMMETRIC RELATIONS;

GRAPHIC METHODS;

EID: 34548263797     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.05.023     Document Type: Article

References (18)

1. R. Bubley, M. Dyer, Graph orientations with no sink and an approximation for a hard case of #SAT, in: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 248-257
2. Cai J.-Y., and Choudhary V. Some results on matchgates and holographic algorithms. ICALP 2006. LNCS vol. 4051 (2006), Springer-Verlag 703-714
3. J.-Y. Cai, V. Choudhary, Valiant's Holant theorem and matchgate tensors, in: Theory and Applications of Models of Computation: Third International Conference, TAMC 2006 in: LNCS, vol. 3959, Springer-Verlag, pp. 248-261
4. M. Cook, Networks of relations, Ph.D. Thesis, 2005
5. Creignou N., and Hermann M. Complexity of generalized satisfiability counting problems. Information and Computation 125 (1996) 1-12
6. Fishier M.E. Statistical mechanics of dimers on a plane lattice. Physical Review 124 (1961) 1664-1672
7. Greenhill C.S. The complexity of counting colourings and independent sets in sparse graphs and hypergraphs. Computational Complexity 9 (2000) 52-72
8. Hunt III H.B., Marathe M.V., Radhakrishnan V., and Stearns R.E. The complexity of planar counting problems. SIAM Journal on Computing 27 (1998) 1142-1167
9. Kasteleyn P.W. The statistics of dimers on a lattice. Physica 27 (1961) 1209-1225
10. Kasteleyn P.W. Graph theory and crystal physics. In: Harary F. (Ed). Graph Theory and Theoretical Physics (1967), Academic Press, London 43-110
11. Liskiewicz M., Ogihara M., and Toda S. The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theoretical Computer Science 304 (2003) 129-156
12. Papadimitriou C. Computational Complexity (1994), Addison-Wesley
13. Temperley H.N.V., and Fishier M.E. Dimer problems in statistical mechanics an exact result. Philosophical Magazine 6 (1961) 1061-1063
14. Vadhan S.P. The complexity of counting in sparse, regular, and planar graphs. SIAM Journal on Computing 31 (2001) 398-427
15. Valiant L.G. The complexity of enumeration and reliability problems. SIAM Journal on Computing 8 (1979) 410-421
16. L.G. Valiant, Holographic Algorithms (extended abstract), FOCS 2004, pp. 306-315
17. L.G. Valiant, Accidental Algorithms, FOCS 2006, pp. 509-517
18. M. Xia, W. Zhao, #3-regular bipartite planar vertex cover is #P-complete, in: Theory and Applications of Models of Computation: Third International Conference, TAMC 2006, in: LNCS, vol. 3959, Springer-Verlag, pp. 356-364