Interactive proofs and the hardness of approximating cliques (Q4371671)

From MaRDI portal
Revision as of 11:26, 25 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jacm/FeigeGLSS96, #quickstatements; #temporary_batch_1732530249250)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1106106
Language Label Description Also known as
English
Interactive proofs and the hardness of approximating cliques
scientific article; zbMATH DE number 1106106

    Statements

    Interactive proofs and the hardness of approximating cliques (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 January 1998
    0 references
    approximation
    0 references
    nonnumerical algorithms
    0 references
    cliques
    0 references
    multi-prover interactive proofs
    0 references

    Identifiers