×

Found 3 Documents (Results 1–3)

Polynomial-space completeness of reachability for succinct branching VASS in dimension one. (English) Zbl 1442.68136

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 119, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI

Non-elementary complexities for branching VASS, MELL, and extensions. (English) Zbl 1394.68189

Proceedings of the joint meeting of the twenty-third EACSL annual conference on computer science logic, CSL, and the 2014 29th annual ACM/IEEE symposium on logic in computer science, LICS 2014, Vienna, Austria, July 14–18, 2014. Los Alamitos, CA: IEEE Computer Society (ISBN 978-1-4503-2886-9). Paper No. 61, 10 p. (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Year of Publication

Main Field