Optimization, Approximation, and Complexity Classes

Papadimitriou, C. H., & Yannakakis, M. (1991). Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences, 43(3), 425-440.

Type

Journal article

Intellectual base

Primary research

Year

1991

Volume

43

Issue

3

Pages

425-440

ISSN

0022-0000

DOI

10.1016/0022-0000(91)90023-x

DOI registrant

Elsevier

Link

https://doi.org/10.1016/0022-0000(91)90023-X

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• L-Reduction
  • Papadimitriou and Yannakakis introduced the construction while developing the classes MAX NP and MAX SNP; its purpose was to make completeness and hardness results preserve approximability rather than mere yes/no solvability.

    This sourceIntroduces MAX NP/MAX SNP and L-reductions as approximation-preserving transformations.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:92a4f1d15b72 · see in the full table