首页> 外文期刊>LIPIcs : Leibniz International Proceedings in Informatics >The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk)
【24h】

The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk)

机译:分析无限状态马尔可夫链,马尔可夫决策过程和随机博弈的复杂性(特邀演讲)

获取原文
           

摘要

In recent years, a considerable amount of research has been devoted to understanding the computational complexity of basic analysis problems, and model checking problems, for finitely-presented countable infinite-state probabilistic systems. In particular
机译:近年来,对于有限表示的可数无限状态概率系统,大量研究致力于理解基本分析问题的计算复杂性和模型检查问题。尤其是

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号