Signature Theory in Holographic Algorithms

DOI10.1007/978-3-540-92182-0_51zbMath1183.68718OpenAlexW2170913548MaRDI QIDQ3596750

Jin-Yi Cai, Pinyan Lu

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.483

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (7)

Holographic algorithms: from art to science ⋮ A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs ⋮ Signature theory in holographic algorithms ⋮ Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems ⋮ Approximate counting for complex-weighted Boolean constraint satisfaction problems ⋮ On symmetric signatures in holographic algorithms ⋮ The Complexity of Symmetric Boolean Parity Holant Problems

This page was built for publication: Signature Theory in Holographic Algorithms