Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete
Blondin et al. showed at LICS 2015 that two-dimensional vector addition systems with states have reachability witnesses of length exponential in the number of states and polynomial in the norm of vectors. The resulting guess-and-verify algorithm is optimal (PSPACE), but only if the input vectors are...
Uložené v:
| Vydané v: | Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science s. 477 - 484 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY, USA
ACM
05.07.2016
|
| Edícia: | ACM Conferences |
| ISBN: | 9781450343916, 1450343910 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!