当前位置: X-MOL 学术arXiv.cs.LO › 论文详情
One-Clock Priced Timed Games are PSPACE-hard
arXiv - CS - Logic in Computer Science Pub Date : 2020-01-13 , DOI: arxiv-2001.04458
John Fearnley; Rasmus Ibsen-Jensen; Rahul Savani

The main result of this paper is that computing the value of a one-clock priced timed game (OCPTG) is PSPACE-hard. Along the way, we provide a family of OCPTGs that have an exponential number of event points. Both results hold even in very restricted classes of games such as DAGs with treewidth three. Finally, we provide a number of positive results, including polynomial-time algorithms for even more restricted classes of OCPTGs such as trees.
更新日期:2020-01-14

 

全部期刊列表>>
施普林格自然
最近合集,配们化学
欢迎访问IOP中国网站
GIANT
自然职场线上招聘会
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
何川
苏昭铭
陈刚
姜涛
李闯创
复旦大学
刘立明
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
上海纽约大学
曾林
天津大学
何振宇
史大永
吉林大学
卓春祥
张昊
刘冬生
试剂库存
down
wechat
bug