Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Probabilistically checkable proofs and their consequences for approximation algorithms
scientific article

    Statements

    Probabilistically checkable proofs and their consequences for approximation algorithms (English)
    0 references
    0 references
    0 references
    0 references
    6 November 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    clique number
    0 references