A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q113877170, #quickstatements; #temporary_batch_1722372779079 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2022.07.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2022.07.023 / rank | |||
Normal rank | |||
Latest revision as of 00:08, 17 December 2024
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
