Holographic algorithms: the power of dimensionality resolved

DOI10.1016/j.tcs.2008.12.047zbMath1172.68058OpenAlexW1971935176MaRDI QIDQ1014633

Pinyan Lu, Jin-Yi Cai

Publication date: 29 April 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.047

zbMATH Keywords

dimensionbasesholographic algorithms

Mathematics Subject Classification ID

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

Related Items (6)

On blockwise symmetric matchgate signatures and higher domain \#CSP ⋮ Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain ⋮ Holographic algorithms by Fibonacci gates ⋮ Holographic algorithms: from art to science ⋮ Holographic algorithms on domains of general size ⋮ Holographic algorithms on bases of rank 2

Cites Work

• Unnamed Item
• Unnamed Item
• On the theory of matchgate computations
• Expressiveness of matchgates.
• The statistics of dimers on a lattice
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• On Symmetric Signatures in Holographic Algorithms
• Some Results on Matchgates and Holographic Algorithms
• Tensor Geometry
• Dimer problem in statistical mechanics-an exact result
• Theory and Applications of Models of Computation

This page was built for publication: Holographic algorithms: the power of dimensionality resolved