Bipartite 3-regular counting problems with mixed signs
From MaRDI portal
Publication:5925701
DOI10.1016/j.jcss.2023.01.006OpenAlexW4320481209MaRDI QIDQ5925701
No author found.
Publication date: 21 April 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2023.01.006
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Holant problems for 3-regular graphs with complex edge functions
- Holographic algorithms: from art to science
- Approximating the permanent of graphs with large factors
- Some observations on holographic algorithms
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
- The Complexity of Counting in Sparse, Regular, and Planar Graphs
- 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
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Holographic Algorithms
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- Edge coloring models and reflection positivity
- Complexity Dichotomies for Counting Problems
- Complexity of Counting CSP with Complex Weights
- Holant Clones and the Approximability of Conservative Holant Problems
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation
- Holant problems and counting CSP
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
- The Complexity of Symmetric Boolean Parity Holant Problems
- Dichotomy result on 3-regular bipartite non-negative functions
