Pages that link to "Item:Q972385"

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

Displaying 9 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)
• The complexity of approximating conservative counting CSPs (Q743130) (← links)
• The complexity of weighted Boolean \#CSP with mixed signs (Q837186) (← links)