The advice complexity of a class of hard online problems (Q1693995)

From MaRDI portal
Revision as of 05:45, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The advice complexity of a class of hard online problems
scientific article

    Statements

    The advice complexity of a class of hard online problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 February 2018
    0 references
    online algorithms
    0 references
    advice complexity
    0 references
    complexity class
    0 references
    asymmetric string guessing
    0 references
    covering designs
    0 references
    asymmetric online covering (AOC)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references