当前位置: X-MOL 学术arXiv.cs.LO › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Reachability is Tower Complete
arXiv - CS - Logic in Computer Science Pub Date : 2020-03-13 , DOI: arxiv-2003.06077
Yuxi Fu, Qizhe Yang

A complete characterization of the complexity of the reachability problem for vector addition system has been open for a long time. The problem is shown to be Tower complete.

中文翻译:

可达性是塔完成

向量加法系统可达性问题复杂性的完整表征已经开放了很长时间。问题显示为 Tower 已完成。
更新日期:2020-03-24
down
wechat
bug