![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "On the Complexity of Solving Markov Decision Problems."
@article{DBLP:journals/corr/abs-1302-4971, author = {Michael L. Littman and Thomas L. Dean and Leslie Pack Kaelbling}, title = {On the Complexity of Solving Markov Decision Problems}, journal = {CoRR}, volume = {abs/1302.4971}, year = {2013}, url = {http://arxiv.org/abs/1302.4971}, eprinttype = {arXiv}, eprint = {1302.4971}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1302-4971.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/uai/LittmanDK95, author = {Michael L. Littman and Thomas L. Dean and Leslie Pack Kaelbling}, editor = {Philippe Besnard and Steve Hanks}, title = {On the Complexity of Solving Markov Decision Problems}, booktitle = {{UAI} '95: Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence, Montreal, Quebec, Canada, August 18-20, 1995}, pages = {394--402}, publisher = {Morgan Kaufmann}, year = {1995}, url = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1\&smnu=2\&article\_id=457\&proceeding\_id=11}, timestamp = {Wed, 03 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/uai/LittmanDK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.