Interactive proofs and the hardness of approximating cliques (Q4371671): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/jacm/FeigeGLSS96, #quickstatements; #temporary_batch_1732530249250 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086653003 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/FeigeGLSS96 / rank | |||
Normal rank | |||
Latest revision as of 11:26, 25 November 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
