Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems (Q5855211)
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 7323174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems |
scientific article; zbMATH DE number 7323174 |
Statements
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems (English)
0 references
15 March 2021
0 references
LCL
0 references
LOCAL model
0 references
hierarchy
0 references
locally checkable labeling
0 references
query complexity
0 references
volume complexity
0 references
