The following pages link to (Q3191606):
Displaying 14 items.
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← 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)
- The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
- FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
- Functional clones and expressibility of partition functions (Q2357376) (← links)
- A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← 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)
- Holographic algorithms on domains of general size (Q6109063) (← links)
- A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory (Q6113105) (← links)
- Undirected determinant and its complexity (Q6166664) (← links)
- A complexity trichotomy for \(k\)-regular asymmetric spin systems with complex edge functions (Q6634373) (← links)
