Interactive proofs and the hardness of approximating cliques (Q4371671)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Interactive proofs and the hardness of approximating cliques |
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
21 January 1998
0 references
approximation
0 references
nonnumerical algorithms
0 references
cliques
0 references
multi-prover interactive proofs
0 references