Bipartite 3-regular counting problems with mixed signs
From MaRDI portal
Publication:5918683
DOI10.1007/978-3-030-86593-1_9OpenAlexW3201455825MaRDI QIDQ5918683
No author found.
Publication date: 20 May 2022
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.01173
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Holographic algorithms: from art to science
- Approximating the permanent of graphs with large factors
- Some observations on holographic algorithms
- 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
- Holant Problems for Regular Graphs with Complex Edge Functions
- 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
- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems
- 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 New Holant Dichotomy 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
This page was built for publication: Bipartite 3-regular counting problems with mixed signs
