Optimization, approximation, and complexity classes, Proceedings of the twentieth annual

Papadimitriou, C., & Mihalis Yannakakis, O. (1988). Optimization, approximation, and complexity classes, Proceedings of the twentieth annual. ACM.

Type

Book chapter

Intellectual base

Review or monograph

Year

1988

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• MAX-3SAT
  • For example, the distinction between constitutive identity and a convenient observable transfers from For a conflicting 3-CNF formula, an assignment is chosen that leaves the fewest clauses false. to An approximation algorithm guarantees a stated fraction of the optimal number of satisfied clauses..

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