arXiv (All)
open access
Integer reachability in VASS with transfers: a refined complexity analysis
Integer reachability is NP-complete for vector addition systems with states (VASS), but becomes PSPACE-complete in the presence of transfer operations. We refine this complexity gap for single-transfer VASS by identifying structural features of transfers responsible for the increase in complexity. E
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bridging the Gap Between Plain VASS and Branching VASS#1109905
- Athermality of generalized Gibbs ensembles#821934
- One Loop, One Bit, Two Tax Regimes: A Geometric Criterion for Subjectivity#688956
- AGI Is Impossible: - Short Formal Version (Triangulation)#77163
- Machine learning augmented branch and bound for mixed integer linear programming.#457546
Record · ID 1156712
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive