Some Results on Matchgates and Holographic Algorithms
From MaRDI portal
Publication:3613802
Recommendations
- Holographic algorithms without matchgates
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4
- On the theory of matchgate computations
- Some observations on holographic algorithms
- Some observations on holographic algorithms
- Holographic algorithms on domains of general size
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
Cited in
(22)- Holographic algorithms on bases of rank 2
- Signature Theory in Holographic Algorithms
- On Symmetric Signatures in Holographic Algorithms
- On blockwise symmetric signatures for matchgates
- A theory for Valiant's matchcircuits (Extended abstract)
- Erratum to: ``Signature theory in holographic algorithms
- Signature theory in holographic algorithms
- On the theory of matchgate computations
- Holographic algorithms by Fibonacci gates
- \(P\) versus \(NP\) and geometry
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
- Holographic algorithms on domains of general size
- Some observations on holographic algorithms
- On symmetric signatures in holographic algorithms
- Holographic algorithms: the power of dimensionality resolved
- Holographic reduction for some counting problems
- FKT is not universal -- a planar holant dichotomy for symmetric constraints
- Theory and Applications of Models of Computation
- Holographic algorithms without matchgates
- Matchgates revisited
- Computational complexity of counting problems on 3-regular planar graphs
- Valiant's holant theorem and matchgate tensors
This page was built for publication: Some Results on Matchgates and Holographic Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613802)
