Pages that link to "Item:Q2009629"
From MaRDI portal
The following pages link to The complexity of planar Boolean \#CSP with complex weights (Q2009629):
Displayed 8 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)
- Holographic algorithms beyond matchgates (Q1706145) (← links)
- Holographic algorithms on bases of rank 2 (Q2252634) (← links)
- On planar valued CSPs (Q2396724) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- Item:Q2009629 (redirect page) (← links)