English(EN) Reachability in 3-VAS

3-VAS 中的可达性问题复杂度已确定为 PSPACE 完全

作者 PulseAugur 编辑部 · [1 个来源] · 2026-08-06 04:00

研究人员确定了特定类型向量加法系统（VAS）中可达性问题的精确复杂度。他们证明了三维对称向量加法系统（3-VAS）的可达性问题是 PSPACE-难的。这一发现结合现有的上界，将一般 3-VAS 和 4-VAS 及其对称变体的可达性问题的复杂度确定为 PSPACE 完全。 AI

排序理由详细介绍计算复杂性研究的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 详细介绍计算复杂性研究的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: 32 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

arXiv cs.CL TIER_1 English(EN) · {\L}ukasz Kami\'nski, S{\l}awomir Lasota · 2026-08-06 04:00

3-VAS 中的可达性

arXiv:2608.04786v1 Announce Type: new Abstract: We settle the exact complexity of the reachability problem in (stateless) vector addition systems (VAS) in fixed low dimension. In dimensions 2-4 it has only been known to be sandwiched between NP and PSPACE. We prove PSPACE-hardnes…