Complexity of finite-horizon Markov decision process problems (Q3457753): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/347476.347480 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981691276 / rank
 
Normal rank

Latest revision as of 02:22, 20 March 2024

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
    0 references