No label defined (Q3766869)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4024808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4024808 |
Statements
1987
0 references
conflict-free vector replacement systems
0 references
NP algorithm
0 references
reachability set
0 references
semilinear set
0 references
0.9587269
0 references
0.86201036
0 references
0.85601354
0 references
0.8553619
0 references
0.8553619
0 references
0.8468397
0 references
[For the entire collection see Zbl 0616.00013.] In this paper, we give completeness results for the reachability, containment, and equivalence problems for conflict-free vector replacement systems (VRSs). We first give an NP algorithm for deciding reachability, thus giving the first primitive recursive algorithm for this problem. Since Jones, Landweber, and Lien have shown this problem to be NP-hard, it follows that the problem is NP-complete. Next, we show as our main result that the containment and equivalence problems are \(\Pi_ 2^{P}\)-complete, where \(\Pi_ 2^{P}\) is the set of all languages whose complements are in the second level of the polynomial-time hierarchy. In showing the upper bound, we first show that the reachability set has a semilinear set (SLS) representation that is exponential in the size of the problem description, but which has a high degree of symmetry. We are then able to utilize a strategy introduced by Huynh (concerning SLSs) to complete our upper bound proof.
0 references