The following pages link to Holographic Algorithms (Q3532577):
Displaying 50 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)
- Holant problems for 3-regular graphs with complex edge functions (Q315538) (← 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)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- \(P\) versus \(NP\) and geometry (Q607059) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← 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)
- Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- On blockwise symmetric matchgate signatures and higher domain \#CSP (Q1633804) (← links)
- Block interpolation: a framework for tight exponential-time counting complexity (Q1640999) (← 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)
- Complexity classification of the six-vertex model (Q1706146) (← 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)
- The complexity of counting \(\mathrm{CSP}^d\) (Q2075393) (← links)
- Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- Evaluations of Tutte polynomials of regular graphs (Q2171029) (← links)
- Counting degree-constrained subgraphs and orientations (Q2174586) (← links)
- Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS (Q2216112) (← links)
- Free fermions behind the disguise (Q2244922) (← links)
- Holographic algorithms on bases of rank 2 (Q2252634) (← links)
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
- Mixing time of Markov chains for the 1-2 model (Q2328714) (← links)
- Functional clones and expressibility of partition functions (Q2357376) (← links)
- A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798) (← links)
- Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ (Q2969880) (← links)
- Progress in Complexity of Counting Problems (Q3004647) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- The Complexity of Boolean Holant Problems with Nonnegative Weights (Q4571918) (← links)
- The 1-2 model (Q4635326) (← links)
- A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← links)
- On the Complexity of Holant Problems (Q4993599) (← links)
- (Q5002678) (← links)
- (Q5009461) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
