Clique problem, cutting plane proofs and communication complexity (Q456115)
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: Clique problem, cutting plane proofs and communication complexity |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clique problem, cutting plane proofs and communication complexity |
scientific article |
Statements
Clique problem, cutting plane proofs and communication complexity (English)
0 references
23 October 2012
0 references
computational complexity
0 references
communication complexity
0 references
clique problem
0 references
cutting plane proof
0 references
0.7905593514442444
0 references
0.7854509353637695
0 references
0.785159170627594
0 references
0.7668096423149109
0 references
0.7363234758377075
0 references
