| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429563 | Journal of Computer and System Sciences | 2013 | 16 Pages |
Abstract
The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
► The covering and boundedness problems for branching VAS are shown 2ExpTime-complete. ► The techniques of Rackoff and Lipton for VAS are substantially extended. ► A new result on small solutions of integer programming problems is obtained.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Stéphane Demri, Marcin Jurdziński, Oded Lachish, Ranko Lazić,