A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A counter-example to the probabilistic universal graph conjecture via randomized communication complexity |
scientific article |
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
