Communication complexity of pairs of graph families with applications (Q5111227)
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: Communication complexity of pairs of graph families with applications |
scientific article; zbMATH DE number 7204347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity of pairs of graph families with applications |
scientific article; zbMATH DE number 7204347 |
Statements
26 May 2020
0 references
communication complexity
0 references
separating family
0 references
FPT-algorithms
0 references
0 references
Communication Complexity of Pairs of Graph Families with Applications (English)
0 references
0.9942734837532043
0 references
0.6908057332038879
0 references
0.6825650930404663
0 references
0.6762990355491638
0 references
