Polynomial-time solvable \#CSP problems via algebraic models and Pfaffian circuits
From MaRDI portal
(Redirected from Publication:898252)
Abstract: A Pfaffian circuit is a tensor contraction network where the edges are labeled with changes of bases in such a way that a very specific set of combinatorial properties are satisfied. By modeling the permissible changes of bases as systems of polynomial equations, and then solving via computation, we are able to identify classes of 0/1 planar #CSP problems solvable in polynomial-time via the Pfaffian circuit evaluation theorem (a variant of L. Valiant's Holant Theorem). We present two different models of 0/1 variables, one that is possible under a homogeneous change of basis, and one that is possible under a heterogeneous change of basis only. We enumerate a series of 1,2,3, and 4-arity gates/cogates that represent constraints, and define a class of constraints that is possible under the assumption of a ``bridge" between two particular changes of bases. We discuss the issue of planarity of Pfaffian circuits, and demonstrate possible directions in algebraic computation for designing a Pfaffian tensor contraction network fragment that can simulate a swap gate/cogate. We conclude by developing the notion of a decomposable gate/cogate, and discuss the computational benefits of this definition.
Recommendations
- Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits
- Generalized counting constraint satisfaction problems with determinantal circuits
- Holographic algorithms without matchgates
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
- Publication:4938661
Cites work
- scientific article; zbMATH DE number 5937218 (Why is no real title available?)
- A Simple Algorithm for Mal'tsev Constraints
- A complete dichotomy rises from the capture of vanishing signatures (extended abstract)
- An effective dichotomy for the counting constraint satisfaction problem
- Colorings and orientations of graphs
- Combinatorial Nullstellensatz
- Complexity of counting CSP with complex weights
- Computational complexity of Holant problems
- Dichotomy for Holant* problems with a function on domain size 3
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
- Gadgets and anti-gadgets leading to a complexity dichotomy
- Generalized counting constraint satisfaction problems with determinantal circuits
- Holant problems and counting CSP
- Holographic Algorithms
- Holographic algorithms without matchgates
- Nowhere-zero flow polynomials
- On the complexity of \#CSP
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Stable sets and polynomials
- The Complexity of Weighted Boolean #CSP
- The complexity of complex weighted Boolean \#CSP
- The complexity of partition functions
- The complexity of the counting constraint satisfaction problem
- The complexity of weighted Boolean \#CSP with mixed signs
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- Valiant's holant theorem and matchgate tensors
Cited in
(5)- Generalized counting constraint satisfaction problems with determinantal circuits
- CSPs with global modular constraints: algorithms and hardness via polynomial representations
- Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits
- A finite-tame-wild trichotomy theorem for tensor diagrams
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
This page was built for publication: Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898252)
