Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy

被引:0
|
作者
Frederiksen, Soren Kristoffer Stiil [1 ]
Miltersen, Peter Bro [1 ]
机构
[1] Aarhus Univ, DK-8000 Aarhus C, Denmark
来源
ALGORITHMS AND COMPUTATION | 2013年 / 8283卷
关键词
EXISTENCE;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We show that the value of a finite-state concurrent reachability game can be approximated to arbitrary precision in TFNP[NP], that is, in the polynomial time hierarchy. Previously, no better bound than PSPACE was known for this problem. The proof is based on formulating a variant of the state reduction algorithm for Markov chains using arbitrary precision floating point arithmetic and giving a rigorous error analysis of the algorithm.
引用
收藏
页码:457 / 467
页数:11
相关论文
共 50 条