Pages that link to "Item:Q5737812"

The following pages link to Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812):

Displaying 26 items.

• A dichotomy for real weighted Holant problems (Q260401) (← links)
• 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)
• On blockwise symmetric matchgate signatures and higher domain \#CSP (Q1633804) (← links)
• On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions (Q1704571) (← links)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• Holographic algorithms by Fibonacci gates (Q1931762) (← links)
• Holographic reduction for some counting problems (Q1944130) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
• Holographic algorithms on bases of rank 2 (Q2252634) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits (Q2396823) (← links)
• A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
• Progress in Complexity of Counting Problems (Q3004647) (← links)
• Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
• On Planar Boolean CSP (Q3448805) (← links)
• Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
• Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
• The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
• Bipartite 3-regular counting problems with mixed signs (Q5918683) (← links)
• Bipartite 3-regular counting problems with mixed signs (Q5925701) (← links)
• Holographic algorithms on domains of general size (Q6109063) (← links)
• Restricted Holant dichotomy on domains 3 and 4 (Q6606220) (← links)
• Restricted Holant dichotomy on domain sizes 3 and 4 (Q6652438) (← links)