Base collapse of holographic algorithms
From MaRDI portal
Publication:5361880
DOI10.1145/2897518.2897560zbMath1373.68445arXiv1511.01230OpenAlexW2222991504MaRDI QIDQ5361880
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.01230
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Some observations on holographic algorithms ⋮ On blockwise symmetric matchgate signatures and higher domain \#CSP ⋮ Holographic algorithms on domains of general size ⋮ Clifford gates in the Holant framework
This page was built for publication: Base collapse of holographic algorithms