The complexity of weighted Boolean \#CSP with mixed signs
type: Item
instance of: scholarly article
title: The complexity of weighted Boolean \#CSP with mixed signs
zbMATH Open document ID: 1171.68013
author: Andrei A. Bulatov
author: Leslie Ann Goldberg
author: Markus Jalsenius
author: David Richerby
author: Martin Dyer
published in: Theoretical Computer Science
publication date: 2009-09-10T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5602752
zbMATH Keywords: complexity of counting
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: partition function
MaRDI profile type: Publication
Wikidata QID: Q56323834
full work available at URL: j.tcs.2009.06.003
OpenAlex ID: W2112167630
cites work: The complexity of partition functions
cites work: The Complexity of the Counting Constraint Satisfaction Problem
cites work: The complexity of complex weighted Boolean \#CSP
cites work: Complexity of generalized satisfiability counting problems
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: An approximation trichotomy for Boolean \#CSP
cites work: The Complexity of Weighted Boolean #CSP
cites work: Q4521549
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: Q5390002
cites work: Inapproximability of the Tutte polynomial
cites work: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
cites work: Q4828516
cites work: On the Structure of Polynomial Time Reducibility
cites work: Q3221403
cites work: Q3184605
cites work: The complexity of satisfiability problems
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Q3140234
DOI: 10.1016/J.TCS.2009.06.003
Recommended article: The Complexity of Weighted Boolean #CSP
Recommended article: The complexity of complex weighted Boolean \#CSP
Recommended article: Q3113689
Recommended article: The complexity of planar Boolean \#CSP with complex weights
Recommended article: The complexity of weighted and unweighted \(\#\)CSP
Recommended article: Complexity of Counting CSP with Complex Weights
Recommended article: Complexity of counting CSP with complex weights
Recommended article: The Complexity of Boolean Holant Problems with Nonnegative Weights
Recommended article: Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
description: scientific article; zbMATH DE number 5602752