The Complexity of Approximating Bounded-Degree Boolean #CSP - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

The Complexity of Approximating Bounded-Degree Boolean #CSP

Résumé

The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs with bounded-degree instances, for constraint languages containing the two unary constant relations {0} and {1}. When the maximum degree is at least 25 we obtain a complete classification of the complexity of this problem. It is exactly solvable in polynomial-time if every relation in the constraint language is affine. It is equivalent to the problem of approximately counting independent sets in bipartite graphs if every relation can be expressed as conjunctions of {0}, {1} and binary implication. Otherwise, there is no FPRAS unless NP=RP. For lower degree bounds, additional cases arise in which the complexity is related to the complexity of approximately counting independent sets in hypergraphs.
Fichier principal
Vignette du fichier
dyer.pdf (223.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00455310 , version 1 (10-02-2010)

Identifiants

  • HAL Id : inria-00455310 , version 1

Citer

Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby. The Complexity of Approximating Bounded-Degree Boolean #CSP. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.323-334. ⟨inria-00455310⟩

Collections

STACS2010
132 Consultations
184 Téléchargements

Partager

Gmail Facebook X LinkedIn More