Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy
From MaRDI portal
Publication:5205792
DOI10.1145/3305272zbMath1485.68104MaRDI QIDQ5205792
Michael Kowalczyk, Tyson Williams, Jin-Yi Cai
Publication date: 16 December 2019
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3305272
interpolation; partition function; counting complexity; holographic algorithms; dichotomy theorem; holant problem
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory, FKT is not universal -- a planar holant dichotomy for symmetric constraints