- The complexity of counting graph homomorphisms Martin Dyer and Catherine Greenhill
- The Complexity of Partition Functions Andrei Bulatov
- Dichotomy Theorems for Counting Problems University of Wisconsin, Madison
- On Symmetric Signatures in Holographic Algorithms JinYi Cai a # and Pinyan Lu b
- Some Results on Matchgates and Holographic Algorithms JinYi Cai 1 Vinay Choudhary 2
- On the Theory of Matchgate Computations JinYi Cai 1 Vinay Choudhary 2
- On Blockwise Symmetric Signatures for JinYi Cai 1 and Pinyan Lu 2#
- Journal of Computer and System Sciences 77 (2011) 4161 Contents lists available at ScienceDirect
- Bases Collapse in Holographic Algorithms Jin-Yi Cai1
- The complexity of counting graph homomorphisms Martin Dyer and Catherine Greenhill
- Holant Problems for Regular Graphs with Complex Edge Michael Kowalczyk
- CS 880: Complexity of Counting Problems 2/2/2012 Lecture 4: Baby Dichotomy Theorem -Part 2
- Holographic Algorithms Jin-Yi Cai
- From Holant To #CSP And Back: Dichotomy For Sangxia Huang
- 880 Lecture 1 January 24, 2012
- Progress on the Complexity of Counting Problems University of Wisconsin, Madison
- Dichotomy Theorems for Counting Problems University of Wisconsin, Madison
- CS 880: Complexity of Counting Problems 02/09/2012 Lecture 6: Holant
- The Complexity of the Counting Constraint Satisfaction Problem Andrei A. Bulatov
- On Counting Homomorphisms to Directed Acyclic Graphs MARTIN DYER
- CS 880: Complexity of Counting Problems February 21, 2012 Lecture 9: Geiger's Theorem
- CS 880: Complexity of Counting Problems 03/06/2012 Lecture 13
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2008 Society for Industrial and Applied Mathematics
- Holographic Algorithms and Complexity of Counting University of Wisconsin, Madison
- Proving Dichotomy Theorems for Counting Problems University of Wisconsin, Madison
- CS 880: Complexity of Counting Problems 02/07/2012 Lecture 5: Holant
- Theoretical Computer Science 410 (2009) 16181628 Contents lists available at ScienceDirect
- CS 880: Complexity of Counting Problems 02/16/2012 Lecture 8: Universal Algebra
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2011 Society for Industrial and Applied Mathematics
- CS 880: Complexity of Counting Problems February 23, 2012 Lecture 10: Reduction and Dyer-Richerby
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2010 Society for Industrial and Applied Mathematics
- Some Results on Matchgates Holographic Algorithms
- DICHOTOMY THEOREMS FOR HOLANT PROBLEMS (DRAFT V0.7)
- Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem
- Accidental Algorthims Leslie G. Valiant
- Dichotomy for Holant Problems of Boolean Domain
- Linear Algebra and its Applications xxx (2011) xxxxxx Contents lists available at ScienceDirect
- Computational Complexity Theory Holographic Algorithms
- CS 880: Complexity of Counting Problems 02/14/2012 Lecture 7: General Dichotomy
- The Complexity of Complex Weighted Boolean #CSP Jin-Yi Cai 1
- The Complexity of Partition Functions Andrei Bulatov
- CS 880: Complexity of Counting Problems 1/31/2012 Lecture 3: Baby Dichotomy Theorem
- This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
- CS 880: Complexity of Counting Problems 1/26/2012 Lecture 2: Introduction -Part 2
- Graph Homomorphisms with Complex Values: A Dichotomy Theorem
- A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights
- Holographic Reduction, Interpolation and Hardness We prove a complexity dichotomy theorem for a class of counting problems expressible by
- Non-negative Weighted #CSPs: An Effective Complexity Dichotomy University of Wisconsin, Madison
- Signature Theory in Holographic Algorithms Jin-Yi Cai
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
