scientific article; zbMATH DE number 7204481
From MaRDI portal
Publication:5111359
DOI10.4230/LIPIcs.ICALP.2017.29zbMath1441.68099arXiv1611.00975MaRDI QIDQ5111359
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1611.00975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Zeros and approximations of holant polynomials on the complex plane ⋮ A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation ⋮ Unnamed Item ⋮ A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory ⋮ Clifford gates in the Holant framework ⋮ Dichotomy for Holant\(^\ast\) problems on the Boolean domain
