Holant Clones and the Approximability of Conservative Holant Problems

DOI10.1145/3381425zbMath1484.68144arXiv1811.00817OpenAlexW3010665772MaRDI QIDQ4987440

Leslie Ann Goldberg, Miriam Backens

Publication date: 3 May 2021

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

approximate countingholant problemfunctional clonecomputational counting problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Applications of universal algebra in computer science (08A70) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (5)

A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation ⋮ Dichotomy result on 3-regular bipartite non-negative functions ⋮ Bipartite 3-regular counting problems with mixed signs ⋮ Dichotomy result on 3-regular bipartite non-negative functions ⋮ Bipartite 3-regular counting problems with mixed signs

This page was built for publication: Holant Clones and the Approximability of Conservative Holant Problems