Arrow Research search
Back to Highlights

Highlights 2017

Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One

Conference Abstract Branching VASS, quantitative games Logic in Computer Science ยท Theoretical Computer Science

Abstract

Abstract available in PDF.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Highlights of Logic, Games and Automata
Archive span
2013-2025
Indexed papers
1236
Paper id
833078191258733599