Pages that link to "Item:Q972385"

The following pages link to An approximation trichotomy for Boolean \#CSP (Q972385):

Displaying 28 items.

• \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
• The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
• The complexity of weighted and unweighted \(\#\)CSP (Q414939) (← links)
• A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724) (← links)
• Boolean max-co-clones (Q494629) (← links)
• Approximately counting paths and cycles in a graph (Q516844) (← 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)
• The complexity of approximating conservative counting CSPs (Q743130) (← links)
• The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)
• The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
• Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
• Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255) (← links)
• Constant unary constraints and symmetric real-weighted counting constraint satisfaction problems (Q2254494) (← links)
• Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
• A Graph Polynomial for Independent Sets of Bipartite Graphs (Q2911069) (← links)
• The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) (← links)
• Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models (Q4969061) (← links)
• Counting Constraint Satisfaction Problems. (Q4993601) (← links)
• Counting of Teams in First-Order Team Logics (Q5092378) (← links)
• (Q5092423) (← links)
• Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
• Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
• (Q5159424) (← links)
• Approximate Counting via Correlation Decay in Spin Systems (Q5743448) (← links)
• Counting Independent Sets and Colorings on Random Regular Bipartite Graphs (Q5875490) (← links)