Holographic algorithms on bases of rank 2
From MaRDI portal
Publication:2252634
DOI10.1016/j.ipl.2014.06.006zbMath1371.68113arXiv1303.7361OpenAlexW1978023013MaRDI QIDQ2252634
Publication date: 18 July 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.7361
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of algorithms (68W01)
Related Items
Cites Work
- Holographic algorithms: from art to science
- Signature theory in holographic algorithms
- On the theory of matchgate computations
- Holographic algorithms: the power of dimensionality resolved
- Holographic algorithms by Fibonacci gates
- The complexity of planar Boolean \#CSP with complex weights
- Holographic Algorithms
- Some Observations on Holographic Algorithms
- Some Results on Matchgates and Holographic Algorithms
- A complete dichotomy rises from the capture of vanishing signatures
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
This page was built for publication: Holographic algorithms on bases of rank 2