Complexity of finite-horizon Markov decision process problems (Q3457753)

From MaRDI portal
Revision as of 10:40, 21 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60016244, #quickstatements; #temporary_batch_1705829395789)
scientific article
Language Label Description Also known as
English
Complexity of finite-horizon Markov decision process problems
scientific article

    Statements

    Complexity of finite-horizon Markov decision process problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 December 2015
    0 references
    computational complexity
    0 references
    Markov decision processes
    0 references
    NP, \(\mathrm{NP}^{\mathrm{PP}}\)
    0 references
    partially observable Markov decision processes
    0 references
    PL
    0 references
    PSPACE
    0 references
    succinct representations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references