The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On state sequences defined by reaction systems
Logic and Program Semantics
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Functions and sequences generated by reaction systems
Theoretical Computer Science
| Hi-index | 0.00 |
In reaction systems introduced by Ehrenfeucht and Rozenberg the number of resources is, by definition, at least 2. If it is exactly 2, the system is referred to as minimal. We compare minimal reaction systems with almost minimal ones, where the number of resources equals 3. The difference turns out to be huge. While many central problems for minimal systems are of low polynomial complexity, the same problems in the almost minimal case are NP- or co-NP-complete. The situation resembles the difference between 2-SAT and 3-SAT, also from the point of view of techniques used. We also compare maximal sequence lengths obtainable in the two cases. We are concerned only with the most simple variant of reaction systems.