Inapproximability Results for Set Splitting and Satisfiability Problems with no Mixed Clauses

Guruswami, V. (2003). Inapproximability Results for Set Splitting and Satisfiability Problems with no Mixed Clauses.

Type

Unclassified

Intellectual base

Unclassified

Year

2003

DOI

10.1007/s00453-003-1072-z

Link

https://doi.org/10.1007/s00453-003-1072-z

Cited by

1 citation across 1 artifact.

Domain-specific

• Set splitting problem
  • … that the finite ground set, subset family, two labeled or unlabeled parts, requirement that every listed subset meet both parts and the decision or optimization objective are explicit. to An applied instance preserves the same invariant under changed scale, notation, dataset, jurisdiction, or implementation..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:44f568d87646 · see in the full table