liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
2000 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 244, no 1-2, 189-203 p.Article in journal (Refereed) Published
Abstract [en]

A boolean constraint satisfaction problem consists of some finite set of constraints (i.e., functions from 0/1-vectors to {0, 1}) and an instance of such a problem is a set of constraints applied to specified subsets of n boolean variables. The goal is to find an assignment to the variables which satisfy all constraint applications. The computational complexity of optimization problems in connection with such problems has been studied extensively but the results have relied on the assumption that the weights are non-negative. The goal of this article is to study variants of these optimization problems where arbitrary weights are allowed. For the four problems that we consider, we give necessary and sufficient conditions for when the problems can be solved in polynomial time. In addition, we show that the problems are NP-equivalent in all other cases. (C) 2000 Elsevier Science B.V. All rights reserved.

Place, publisher, year, edition, pages
2000. Vol. 244, no 1-2, 189-203 p.
Keyword [en]
computational complexity, Boolean constraints, optimization problems
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-49635OAI: diva2:270531
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2011-01-14

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Jonsson, Peter
By organisation
The Institute of TechnologyTCSLAB - Theoretical Computer Science Laboratory
In the same journal
Theoretical Computer Science
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 30 hits
ReferencesLink to record
Permanent link

Direct link