Pages that link to "Item:Q898252"
From MaRDI portal
The following pages link to Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252):
Displaying 5 items.
- Generalized counting constraint satisfaction problems with determinantal circuits (Q472444) (← links)
- FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
- A finite-tame-wild trichotomy theorem for tensor diagrams (Q2189491) (← links)
- Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits (Q2396823) (← links)
- CSPs with global modular constraints: algorithms and hardness via polynomial representations (Q5212801) (← links)