Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems (Q5855211)

From MaRDI portal
Revision as of 15:40, 3 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7323174
Language Label Description Also known as
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
    0 references
    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

    Identifiers