Pages that link to "Item:Q5395728"
From MaRDI portal
The following pages link to The expressibility of functions on the boolean domain, with applications to counting CSPs (Q5395728):
Displayed 18 items.
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Boolean max-co-clones (Q494629) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
- Functional clones and expressibility of partition functions (Q2357376) (← links)
- The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) (← links)
- A complexity classification of spin systems with an external field (Q2962306) (← links)
- Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models (Q4969061) (← links)
- A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← links)
- Counting Constraint Satisfaction Problems. (Q4993601) (← links)
- A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation (Q5096443) (← links)
- (Q5159424) (← links)
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results (Q5506693) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory (Q6113105) (← links)