搜索结果: 1-2 共查到“计算数学 Computational Complexity”相关记录2条 . 查询时间(0.171 秒)
On the computational complexity of stochastic controller optimization in POMDPs
Partially observable Markov decision process stochastic controller bilinear program computational complexity Motzkin-Straus theorem
2011/10/8
Abstract: We show that the problem of finding an optimal stochastic 'blind' controller in a Markov decision process is an NP-hard problem. The corresponding decision problem is NP-hard, in PSPACE, and...
Duality Gap, Computational Complexity and NP Completeness: A Survey
Duality Gap Computational Complexity NP Completeness
2011/2/28
In this paper, we survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimizatio...