Abstract
In this paper, we present a different look on splicing systems, namely as problem solvers. After defining the concept of accepting splicing system we discuss how these systems can be used as problem solvers. Then we construct an accepting splicing system able to uniformly solve SAT in time O(m + n) for a formula of length m over n variables. We also propose a uniform solution based on accepting splicing systems to HPP that runs in time O(n), where n is the number of vertices of the instance of HPP. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Loos, R., Martín-Vide, C., & Mitrana, V. (2006). Solving SAT and HPP with accepting splicing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 771–777). Springer Verlag. https://doi.org/10.1007/11844297_78
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
