The complexity of counting \(\mathrm{CSP}^d\)
From MaRDI portal
Publication:2075393
DOI10.1007/s00224-021-10060-xOpenAlexW3197909928MaRDI QIDQ2075393
Publication date: 14 February 2022
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-021-10060-x
Theory of computing (68Qxx) Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dichotomy for real weighted Holant problems
- The complexity of complex weighted Boolean \#CSP
- Clifford gates in the Holant framework
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures
- An Effective Dichotomy for the Counting Constraint Satisfaction Problem
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
- Holographic Algorithms
- The Complexity of Boolean Holant Problems with Nonnegative Weights
- Complexity of Counting CSP with Complex Weights
- A New Holant Dichotomy Inspired by Quantum Computation
- Holant problems and counting CSP
- A Complexity Dichotomy for Partition Functions with Mixed Signs
- The complexity of the counting constraint satisfaction problem
- Dichotomy for Holant Problems with a Function on Domain Size 3
- Graph Homomorphisms with Complex Values: A Dichotomy Theorem
