Inapproximability results for set splitting and satisfiability problems with no mixed clauses
type: Item
instance of: scholarly article
title: Inapproximability results for set splitting and satisfiability problems with no mixed clauses
zbMATH Open document ID: 1095.68036
author: Venkatesan Guruswami
published in: Algorithmica
publication date: 2004-09-22T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2101907
MaRDI profile type: Publication
full work available at URL: s00453-003-1072-z
OpenAlex ID: W2806518615
DOI: 10.1007/S00453-003-1072-Z
Recommended article: Q2753735
Recommended article: Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat}
Recommended article: The approximability of non-Boolean satisfiability problems and restricted integer programming
Recommended article: On the Approximability of Splitting-SAT in 2-CNF Horn Formulas
Recommended article: Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set
Recommended article: Q5365140
Recommended article: Improved approximations for max set splitting and max NAE SAT
Recommended article: Parameterized (in)approximability of subset problems
Recommended article: Exact satisfiability, a natural extension of set partition, and its average case behavior
Recommended article: On Inconsistent Clause-Subsets for Max-SAT Solving
description: scientific article; zbMATH DE number 2101907