Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete

Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, Ali Shafiee. Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete. In Silvia Chiappa, Sara Magliacane, editors, Conference on Uncertainty in Artificial Intelligence, Rio Othon Palace, Rio de Janeiro, Brazil, 21-25 July 2025. Volume 286 of Proceedings of Machine Learning Research, pages 238-256, PMLR, 2025. [doi]

@inproceedings{AsadiCSS25,
  title = {Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete},
  author = {Ali Asadi and Krishnendu Chatterjee and Raimundo Saona and Ali Shafiee},
  year = {2025},
  url = {https://proceedings.mlr.press/v286/asadi25b.html},
  researchr = {https://researchr.org/publication/AsadiCSS25},
  cites = {0},
  citedby = {0},
  pages = {238-256},
  booktitle = {Conference on Uncertainty in Artificial Intelligence, Rio Othon Palace, Rio de Janeiro, Brazil, 21-25 July 2025},
  editor = {Silvia Chiappa and Sara Magliacane},
  volume = {286},
  series = {Proceedings of Machine Learning Research},
  publisher = {PMLR},
}