📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting (2015)

First Author: Creignou N

Attributed to: Constraint Satisfaction for Configuration: Logical Fundamentals,Algorithms, and Complexity funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.3233/fi-2015-1159

Publication URI: http://dx.doi.org/10.3233/fi-2015-1159

Type: Journal Article/Review

Parent Publication: Fundamenta Informaticae

Issue: 4

ISSN: 0169-2968