Signature Theory in Holographic Algorithms

DOI10.1007/978-3-540-92182-0_51zbMATH Open1183.68718OpenAlexW2170913548MaRDI QIDQ3596750FDOQ3596750

Authors: 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

Recommendations

• Signature theory in holographic algorithms
• On the theory of matchgate computations
• Holographic algorithms: from art to science
• Some Results on Matchgates and Holographic Algorithms
• Holographic algorithms: from art to science

Mathematics Subject Classification ID

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

Cited In (7)

• Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
• A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
• Signature theory in holographic algorithms
• Holographic algorithms: from art to science
• On symmetric signatures in holographic algorithms
• Nearly-linear size holographic proofs
• The complexity of symmetric Boolean parity Holant problems (extended abstract)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596750)