The following pages link to Expressiveness of matchgates. (Q1853537):
Displaying 26 items.
- Computing the Tutte polynomial of lattice path matroids using determinantal circuits (Q496045) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- Holographic algorithms: from art to science (Q619900) (← links)
- Signature theory in holographic algorithms (Q652529) (← links)
- Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (Q690466) (← links)
- Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
- On the theory of matchgate computations (Q841626) (← links)
- On blockwise symmetric signatures for matchgates (Q846363) (← links)
- On symmetric signatures in holographic algorithms (Q968267) (← links)
- Holographic algorithms: the power of dimensionality resolved (Q1014633) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- On blockwise symmetric matchgate signatures and higher domain \#CSP (Q1633804) (← links)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Complexity classification of the six-vertex model (Q1706146) (← links)
- Holographic algorithms without matchgates (Q1931767) (← links)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
- Evaluations of Tutte polynomials of regular graphs (Q2171029) (← links)
- Counting degree-constrained subgraphs and orientations (Q2174586) (← links)
- Valiant's holant theorem and matchgate tensors (Q2382280) (← links)
- Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits (Q2396823) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Undirected determinant and its complexity (Q6166664) (← links)
- A complexity trichotomy for \(k\)-regular asymmetric spin systems with complex edge functions (Q6634373) (← links)
