Advice complexity of priority algorithms (Q5916086)

From MaRDI portal
Revision as of 23:57, 25 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q126802091, #quickstatements; #temporary_batch_1721947977513)
scientific article; zbMATH DE number 7207264
Language Label Description Also known as
English
Advice complexity of priority algorithms
scientific article; zbMATH DE number 7207264

    Statements

    title
    Advice complexity of priority algorithms (English)
    0 references
    author
    Allan Borodin
    0 references
    Joan. Boyar
    0 references
    Kim S. Larsen
    0 references
    Denis Pankratov
    0 references
    publication date
    15 January 2019
    0 references
    2 June 2020
    0 references
    zbMATH Keywords
    priority algorithms
    0 references
    advice complexity
    0 references
    greedy algorithms
    0 references
    optimization problems
    0 references

    Identifiers

    zbMATH Open document ID
    1444.68298
    0 references
    1444.68299
    0 references
    Mathematics Subject Classification ID
    68W27
    0 references
    68Q17
    0 references
    90C59
    0 references
    zbMATH DE Number
    7002064
    0 references
    7207264
    0 references
    OpenAlex ID
    W3022611370
    0 references
    W2807933378
    0 references
    arXiv ID
    1806.06223
    0 references
    Wikidata QID
    Q126802091
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5916086&oldid=36691882"
    Powered by MediaWiki