Interactive proofs and the hardness of approximating cliques (Q4371671): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q294722
Property / author
 
Property / author: Q172552 / rank
Normal rank
 

Revision as of 12:47, 12 February 2024

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
    21 January 1998
    0 references
    approximation
    0 references
    nonnumerical algorithms
    0 references
    cliques
    0 references
    multi-prover interactive proofs
    0 references

    Identifiers