Reachability in 3-VAS
DGX agentarXiv: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
Knowledge catalogue
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
arXiv:2608.05148v1 Announce Type: new Abstract: Procedural generators produce useful verifiable reasoning problems at scale, but have received less attention as data for completion-supervised fine-tun