Pages that link to "Item:Q619900"

The following pages link to Holographic algorithms: from art to science (Q619900):

Displaying 41 items.

• Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
• Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
• The complexity of complex weighted Boolean \#CSP (Q395011) (← links)
• A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724) (← links)
• Signature theory in holographic algorithms (Q652529) (← links)
• Spin systems on \(k\)-regular graphs with complex edge functions (Q690458) (← links)
• Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (Q690466) (← links)
• Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490) (← links)
• Basis collapse in holographic algorithms (Q937202) (← links)
• On symmetric signatures in holographic algorithms (Q968267) (← links)
• Holographic algorithms: the power of dimensionality resolved (Q1014633) (← links)
• Penny-packing and two-dimensional codes (Q1262539) (← links)
• Holographic algorithms beyond matchgates (Q1706145) (← links)
• Clifford gates in the Holant framework (Q1786604) (← links)
• Holographic reduction, interpolation and hardness (Q1926111) (← links)
• Holographic algorithms by Fibonacci gates (Q1931762) (← links)
• Holographic algorithms without matchgates (Q1931767) (← links)
• From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems (Q1934313) (← links)
• The complexity of planar Boolean \#CSP with complex weights (Q2009629) (← links)
• Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• FKT is not universal -- a planar holant dichotomy for symmetric constraints (Q2075391) (← links)
• Evaluations of Tutte polynomials of regular graphs (Q2171029) (← links)
• Counting degree-constrained subgraphs and orientations (Q2174586) (← links)
• Holographic algorithms on bases of rank 2 (Q2252634) (← links)
• Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems (Q2254494) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
• Holoscopy (Q2877922) (← links)
• Counting Homomorphisms to Square-Free Graphs, Modulo 2 (Q3448822) (← links)
• On the Complexity of Holant Problems (Q4993599) (← links)
• (Q5005151) (← links)
• Counting problems in parameterized complexity (Q5009461) (← links)
• Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
• Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain (Q5073518) (← links)
• Automata, Languages and Programming (Q5716747) (← 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)