A Computational Proof of Complexity of Some Restricted Counting Problems
We explore a computational approach to proving intractability of certain counting problems. More specifically we study the complexity of Holant of 3-regular graphs. These problems include concrete problems such as counting the number of vertex covers or independent sets for 3-regular graphs. The high level principle of our approach is algebraic, which provides sufficient conditions for interpolation to succeed. Another algebraic component is holographic reductions. We then analyze in detail polynomial maps on ℝ2 induced by some combinatorial constructions. These maps define sufficiently complicated dynamics of ℝ2 that we can only analyze them computationally. We use both numerical computation (as intuitive guidance) and symbolic computation (as proof theoretic verification) to derive that a certain collection of combinatorial constructions, in myriad combinations, fulfills the algebraic requirements of proving #P-hardness. The final result is a dichotomy theorem for a class of counting problems.
KeywordsVertex Cover Dichotomy Theorem Symbolic Computation Counting Problem Recursive Construction
Unable to display preview. Download preview PDF.
- 3.Cai, J.-Y., Lu, P.: Holographic Algorithms: From Art to Science. In: Proceedings of STOC 2007, pp. 401–410 (2007)Google Scholar
- 4.Cai, J.-Y., Lu, P., Xia, M.: Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness. In: FOCS 2008, pp. 644–653 (2008)Google Scholar
- 5.Cai, J.-Y., Lu, P., Xia, M.: Holant Problems and Counting CSP. In: STOC 2009 (to appear, 2009)Google Scholar
- 6.Collins, G.: Quantifier Elimination for Real Closed Fields by Cylindric Algebraic Decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)Google Scholar
- 8.Creignou, N., Khanna, S., Sudan, M.: Complexity classifications of boolean constraint satisfaction problems. SIAM Monographs on Discrete Mathematics and Applications (2001)Google Scholar
- 9.Dyer, M.E., Goldberg, L.A., Jerrum, M.: The Complexity of Weighted Boolean #CSP CoRR abs/0704.3683 (2007)Google Scholar
- 10.Dyer, M.E., Goldberg, L.A., Paterson, M.: On counting homomorphisms to directed acyclic graphs. J. ACM 54(6) (2007)Google Scholar
- 12.Goldberg, L.A., Grohe, M., Jerrum, M., Thurley, M.: A complexity dichotomy for partition functions with mixed signs. CoRR abs/0804.1932 (2008)Google Scholar
- 14.Tarski, A.: A Decision Method for Elementary Algebra and Geometry, Univ. of Calif. (1951)Google Scholar
- 16.Valiant, L.G.: Holographic Algorithms (Extended Abstract). In: Proc. 45th IEEE Symposium on Foundations of Computer Science, pp. 306–315 (2004)Google Scholar