The complexity of weighted and unweighted # CSP

The complexity of weighted and unweighted # CSP

We give some reductions among problems in (nonnegative) weighted # CSP which restrict the class of functions that needs to be considered in computational complexity studies. Our reductions can be applied to both exact and approximate computation. In particular, we show that the recent dichotomy for...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences 2012-03, Vol.78 (2), p.681-688
Hauptverfasser: Bulatov, Andrei, Dyer, Martin, Goldberg, Leslie Ann, Jalsenius, Markus, Jerrum, Mark, Richerby, David
Format: Artikel
Sprache:eng
Schlagworte:
Approximation
Complexity
Complexity theory
Computation
Constraint satisfaction
Counting
Dichotomies
Mathematical analysis
Mathematical models
Reduction
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We give some reductions among problems in (nonnegative) weighted # CSP which restrict the class of functions that needs to be considered in computational complexity studies. Our reductions can be applied to both exact and approximate computation. In particular, we show that the recent dichotomy for unweighted # CSP can be extended to rational-weighted # CSP. ► Proposes and applies a new class of reductions for weighted # CSP problems. ► The reductions can be applied to both exact and approximate computation. ► Shows equivalence for various classes of weighted # CSP problems. ► Extends the dichotomy for unweighted # CSP to rational-weighted # CSP. ► Shows that all weighted # CSP problems can be reduced to problems with one function.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2011.12.002