The complexity of optimization problems¶

Krentel, M. (1988). The complexity of optimization problems.

Type: Unclassified
Intellectual base: Unclassified
Year: 1988
DOI: 10.1016/0022-0000(88)90039-6
Link: https://doi.org/10.1016/0022-0000(88)90039-6

Cited by¶

1 citation across 1 artifact.

Domain-specific¶

Maximum satisfiability problem
- MAX-SAT extends satisfiability from a feasibility question to an objective, with unweighted, weighted, partial, and bounded-clause variants and approximation guarantees.

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:a9985b400c7c · see in the full table