Lower bounds for the modular communication complexity of various graph accessibility problems (Q5096349)
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: Lower bounds for the modular communication complexity of various graph accessibility problems |
scientific article; zbMATH DE number 7572160
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the modular communication complexity of various graph accessibility problems |
scientific article; zbMATH DE number 7572160 |
Statements
Lower bounds for the modular communication complexity of various graph accessibility problems (English)
0 references
16 August 2022
0 references
computational complexity
0 references
modular communication protocols
0 references
variation ranks
0 references
projection reductions
0 references
GAP
0 references
