Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2009: Computing and Combinatorics pp 472–485Cite as

Classification of a Class of Counting Problems Using Holographic Reductions

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5609))

Abstract

The purpose of this work is to prove a generalization of the dichotomy theorem from [6], extending that result to a larger class of counting problems. This is achieved through the use of interpolation and holographic reductions. We also use holographic reductions to establish a close connection between a class of problems which are solvable using Fibonacci gates and the class of problems which can be solved by applying a particular kind of counting argument.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bulatov, A.A., Dalmau, V.: Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. Information and Computation 205(5), 651–678 (2007)

    Google Scholar 

  2. Bulatov, A.A., Grohe, M.: The Complexity of Partition Functions. Theoretical Computer Science 348(2-3), 148–186 (2005)

    Google Scholar 

  3. Cai, J.-Y., Lu, P.: Holographic Algorithms: From Art to Science. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 401–410. ACM Press, New York (2007)

    Google Scholar 

  4. Cai, J.-Y., Lu, P.: On Symmetric Signatures in Holographic Algorithms. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 429–440. Springer, Heidelberg (2007)

    Google Scholar 

  5. Cai, J.-Y., Chen, X., Lu, P.: Graph Homomorphisms with Complex Values: A Dichotomy Theorem. Computing Research Repository, arXiv:0903.4728v1 (2009)

    Google Scholar 

  6. Cai, J.-Y., Lu, P., Xia, M.: Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 644–653. IEEE Computer Society Press, Los Alamitos (2008)

    Google Scholar 

  7. Cai, J.-Y., Lu, P., Xia, M.: A Computational Approach to Proving Computational Complexity of Some Counting Problems. In: Theory and Applications of Models of Computation: 6th International Conference (to appear, 2009)

    Google Scholar 

  8. Cai, J.-Y., Lu, P., Xia, M.: Holant Problems and Counting CSP. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (to appear, 2009)

    Google Scholar 

  9. Creignou, N., Hermann, M.: Complexity of Generalized Satisfiability Counting Problems. Information and Computation 125(1), 1–12 (1996)

    Google Scholar 

  10. Creignou, N., Khanna, S., Sudan, M.: Complexity Classifications of Boolean Constraint Satisfaction Problems. Society for Industrial and Applied Mathematics, Philadelphia (2001)

    Google Scholar 

  11. Dodson, C.T.J., Poston, T.: Tensor Geometry. Springer, New York (1991)

    Google Scholar 

  12. Dyer, M.E., Goldberg, L.A., Jerrum, M.: The Complexity of Weighted Boolean #CSP. Computing Research Repository, arXiv:0704.3683v2 (2008)

    Google Scholar 

  13. Dyer, M.E., Goldberg, L.A., Paterson, M.: On Counting Homomorphisms to Directed Acyclic Graphs. Journal of the ACM 54(6) (2007)

    Google Scholar 

  14. Dyer, M.E., Greenhill, C.S.: The Complexity of Counting Graph Homomorphisms. Random Structures and Algorithms 17(3-4), 260–289 (2000)

    Google Scholar 

  15. Freedman, M., Lovász, L., Schrijver, A.: Reflection positivity, rank connectivity, and homomorphism of graphs. Journal of the American Mathematical Society 20, 37–51 (2007)

    Google Scholar 

  16. Goldberg, L.A., Grohe, M., Jerrum, M., Thurley, M.: A complexity dichotomy for partition functions with mixed signs. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (to appear, 2009)

    Google Scholar 

  17. Goldberg, L.A., Kelk, S., Paterson, M.: The complexity of choosing an H-colouring (nearly) uniformly at random. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 53–62. ACM Press, New York (2002)

    Google Scholar 

  18. Hell, P., Nes̆etr̆il, J., Zhu, X.: Duality and polynomial testing of tree homomorphisms. Transactions of the American Mathematical Society 348(4), 1281–1297 (1996)

    Google Scholar 

  19. Kasteleyn, P.W.: The statistics of dimers on a lattice. Physica 27, 1209–1225 (1961)

    Google Scholar 

  20. Kasteleyn, P.W.: Graph Theory and Crystal Physics. In: Graph Theory and Theoretical Physics, pp. 43–110. Academic Press, London (1967)

    Google Scholar 

  21. Lovász, L.: Operations with structures. Acta Mathematica Academiae Scientiarum Hungaricae 18, 321–328 (1967)

    Google Scholar 

  22. Temperley, H.N.V., Fisher, M.E.: Dimer problem in statistical mechanics - an exact result. Philosophical Magazine 6, 1061–1063 (1961)

    Google Scholar 

  23. Vadhan, S.P.: The Complexity of Counting in Sparse, Regular, and Planar Graphs. SIAM Journal on Computing 31(2), 398–427 (2001)

    Google Scholar 

  24. Valiant, L.G.: The Complexity of Computing the Permanent. Theoretical Computer Science 8, 189–201 (1979)

    Google Scholar 

  25. Valiant, L.G.: Holographic Algorithms (Extended Abstract). In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 306–315. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  26. Valiant, L.G.: Quantum Circuits That Can Be Simulated Classically in Polynomial Time. SIAM Journal on Computing 31(4), 1229–1254 (2002)

    Google Scholar 

  27. Valiant, L.G.: Accidental Algorithms. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 509–517. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Northern Michigan University, Marquette, MI, 49855, USA

    Michael Kowalczyk

Authors
  1. Michael Kowalczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science and Engineering Department, State University of New York at Buffalo, 201 Bell Hall, 14260, Amherst, NY, USA

    Hung Q. Ngo

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kowalczyk, M. (2009). Classification of a Class of Counting Problems Using Holographic Reductions. In: Ngo, H.Q. (eds) Computing and Combinatorics. COCOON 2009. Lecture Notes in Computer Science, vol 5609. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02882-3_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02882-3_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02881-6

  • Online ISBN: 978-3-642-02882-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation