Interactive proofs and the hardness of approximating cliques (Q4371671): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q55870237, #quickstatements; #temporary_batch_1706814575051 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55870237 / rank | |||
Normal rank | |||
Revision as of 20:48, 1 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
21 January 1998
0 references
approximation
0 references
nonnumerical algorithms
0 references
cliques
0 references
multi-prover interactive proofs
0 references
