Communication complexity and graph families (Q5205796)
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 7143717
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Communication complexity and graph families |
scientific article; zbMATH DE number 7143717 |
Statements
Communication Complexity and Graph Families (English)
0 references
16 December 2019
0 references
communication complexity
0 references
FPT algorithms
0 references
separating family
0 references
0.9942734837532043
0 references
0.6912944912910461
0 references
0.6846733689308167
0 references
0.6843492984771729
0 references
