<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-06-25 05:38:35Computational complexity theory NP-complete Gadget NP PSPACE-complete Graph Theoretical computer science Applied mathematics Complexity classes |
| Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete Michael Blondin1, 2 Alain Finkel1DocID: 1vlLP - View Document |
| Subway Shuffle is PSPACE–complete (Preliminary draft) Marzio De Biasi∗ Tim Ophelders†DocID: 1viyb - View Document |
| Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete Michael Blondin∗†‡ , Alain Finkel†§ , Stefan G¨oller†¶k , Christoph Haase†§k and Pierre McKenzie∗†∗∗ ∗ DIRODocID: 1uHDR - View Document |
| Introduction & Motivation Relations and Operations Boolean and 3-element casesDocID: 1qCnb - View Document |
| The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K.DocID: 1q2Cn - View Document |