Metraipolis › archive › dc_99ea5f89f838

Reachability in 3-VAS — arXiv:2608.04786

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.04786
License (as archived)
CC0-1.0
Archived
2026-10-31T11:24:47.272Z
SHA-256 of the archived text
383d5781fb0e6bf13813eb860bf4c20283dc347dcf237b1b818899941be2a9a3
Stable URL of this page
https://metraipolis.com/documento/dc_99ea5f89f838

How to cite

Reachability in 3-VAS — arXiv:2608.04786 — arXiv (en), https://arxiv.org/abs/2608.04786 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_99ea5f89f838 (Metraipolis archive dc_99ea5f89f838, sha256 383d5781fb0e6bf13813eb860bf4c20283dc347dcf237b1b818899941be2a9a3)
BibTeX
@misc{dc99ea5f89f838,
  title = {Reachability in 3-VAS — arXiv:2608.04786},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04786},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_99ea5f89f838; sha256 383d5781fb0e6bf13813eb860bf4c20283dc347dcf237b1b818899941be2a9a3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04786. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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-hardness of the reachability problem for symmetric vector addition systems in dimension 3 (3-VAS), a restricted fragment of general 3-VAS. Combined with previously established PSPACE upper bounds, our result settles the complexity of the problem to be PSPACE-complete in 3-VAS and 4-VAS, as well as in their symmetric fragments.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-06 in cs.CL).
Categorie arXiv: Computation and Language (cs.CL).
Pagina del lavoro: https://arxiv.org/abs/2608.04786 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T11:13:23.186Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).