Pages that link to "Item:Q1931767"

The following pages link to Holographic algorithms without matchgates (Q1931767):

Displaying 9 items.

• Generalized counting constraint satisfaction problems with determinantal circuits (Q472444) (← links)
• Computing the Tutte polynomial of lattice path matroids using determinantal circuits (Q496045) (← links)
• \(P\) versus \(NP\) and geometry (Q607059) (← 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)
• FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
• Counting degree-constrained subgraphs and orientations (Q2174586) (← links)
• A finite-tame-wild trichotomy theorem for tensor diagrams (Q2189491) (← links)
• Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits (Q2396823) (← links)