Some Observations on Holographic Algorithms
From MaRDI portal
Publication:3557051
DOI10.1007/978-3-642-12200-2_50zbMath1283.68393MaRDI QIDQ3557051
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_50
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
The Complexity of Symmetric Boolean Parity Holant Problems, A dichotomy for real weighted Holant problems, A collapse theorem for holographic algorithms with matchgates on domain size at most 4, On blockwise symmetric matchgate signatures and higher domain \#CSP, Holographic algorithms on bases of rank 2