Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618)
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: Probabilistically checkable proofs and their consequences for approximation algorithms |
scientific article; zbMATH DE number 722490
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistically checkable proofs and their consequences for approximation algorithms |
scientific article; zbMATH DE number 722490 |
Statements
Probabilistically checkable proofs and their consequences for approximation algorithms (English)
0 references
6 November 1995
0 references
approximation algorithms
0 references
clique number
0 references
