A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7600624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A counter-example to the probabilistic universal graph conjecture via randomized communication complexity |
scientific article; zbMATH DE number 7600624 |
Statements
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (English)
0 references
13 October 2022
0 references
probabilistic universal graph conjecture
0 references
universal graph conjecture
0 references
randomized communication complexity
0 references
implicit graph representation
0 references
labeling scheme
0 references
hereditary graph properties
0 references
0 references
0.7170894742012024
0 references
0.7090495824813843
0 references
0.7010581493377686
0 references
0.7009367942810059
0 references
