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...
Saved in:
| Published in: | Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 477 - 484 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
New York, NY, USA
ACM
05.07.2016
|
| Series: | ACM Conferences |
| ISBN: | 9781450343916, 1450343910 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!