Pages that link to "Item:Q2009629"
From MaRDI portal
The following pages link to The complexity of planar Boolean \#CSP with complex weights (Q2009629):
Displaying 15 items.
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- A collapse theorem for holographic algorithms with matchgates on domain size at most 4 (Q476175) (← links)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← 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)
- Holographic algorithms on bases of rank 2 (Q2252634) (← links)
- On planar valued CSPs (Q2396724) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- Counting Constraint Satisfaction Problems. (Q4993601) (← links)
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
- (Q5326588) (redirect page) (← links)
- Holographic algorithms on domains of general size (Q6109063) (← links)
- A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory (Q6113105) (← links)
