Generalized counting constraint satisfaction problems with determinantal circuits

DOI10.1016/j.laa.2014.09.050zbMath1302.05108arXiv1302.1932OpenAlexW2084163074MaRDI QIDQ472444

Jason Morton, Jacob M. Turner

Publication date: 19 November 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.1932

zbMATH Keywords

monoidal categoriescounting complexitytensor network

Mathematics Subject Classification ID

Related Items (4)

Tensor network contractions for \#SAT ⋮ A finite-tame-wild trichotomy theorem for tensor diagrams ⋮ Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits ⋮ Computing the Tutte polynomial of lattice path matroids using determinantal circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the Tutte polynomial of lattice path matroids using determinantal circuits
• The geometry of tensor calculus. I
• Towards an algebraic theory of Boolean circuits.
• The complexity of tensor calculus
• Lattice path matroids: Enumerative aspects and Tutte polynomials
• A combinatorial Laplacian with vertex weights
• Holographic algorithms without matchgates
• Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
• Categorical quantum circuits
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• The Complexity of the Counting Constraint Satisfaction Problem
• Traced monoidal categories
• Belief propagation in monoidal categories
• Multi-Path Matroids
• Computational Complexity
• Complexity of counting CSP with complex weights

This page was built for publication: Generalized counting constraint satisfaction problems with determinantal circuits