Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
type: Item
instance of: scholarly article
title: Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
zbMATH Open document ID: 0945.68078
DOI: 10.1016/S0304-3975(98)00343-0
author: Peter Jonsson
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1493483
zbMATH Keywords: computational complexity
zbMATH Keywords: Boolean constraints
zbMATH Keywords: optimization problems
MaRDI profile type: Publication
cites work: A dichotomy theorem for maximum generalized satisfiability problems.
cites work: Complexity of generalized satisfiability counting problems
cites work: The directed subgraph homeomorphism problem
cites work: A bounded approximation for the minimum cost 2-sat problem
cites work: On the complexity of H-coloring
cites work: Q3236253
cites work: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
cites work: Q3236252
cites work: Q4764626
cites work: Q3050157
cites work: Q4526965
cites work: Q4739657
cites work: The complexity of satisfiability problems
cites work: Q3818127
description: scientific article; zbMATH DE number 1493483