Pages that link to "Item:Q2382280"
From MaRDI portal
The following pages link to Valiant's holant theorem and matchgate tensors (Q2382280):
Displaying 12 items.
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- Holographic algorithms: from art to science (Q619900) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Holographic reduction, interpolation and hardness (Q1926111) (← links)
- Holographic algorithms by Fibonacci gates (Q1931762) (← links)
- Holographic algorithms without matchgates (Q1931767) (← links)
- The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
- (Q5002678) (← links)
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation (Q5096443) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- Holographic algorithms on domains of general size (Q6109063) (← links)
