We present linear time solutions to two NP-complete problems, namely SAT and the directed Hamiltonian Path Problem (HPP), based on accepting networks of splicing processors (ANSP) having all resources (size, number of rules and symbols) linearly bounded by the size of the given instance. The underlying structure of these ANSPs does not depend on the number of clauses, in the case of SAT, and the number of edges, in the case of HPP. Furthermore, the running time of the ANSP solving HPP does not depend on the number of edges of the given graph and this network provides all solutions, if any, of the given instance of HPP. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Manea, F., Martin-Vide, C., & Mitrana, V. (2005). Accepting networks of splicing processors. In Lecture Notes in Computer Science (Vol. 3526, pp. 300–309). Springer Verlag. https://doi.org/10.1007/11494645_38
Mendeley helps you to discover research relevant for your work.