Limit-sure reachability in POMDPs under constant-memory policies is NP-complete.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Limit-sure reachability for small memory policies in POMDPs is NP-complete
Limit-sure reachability in POMDPs under constant-memory policies is NP-complete.