Solving SAT and HPP with accepting splicing systems

  • Authors:

  • Remco Loos;Carlos Martín-Vide;Victor Mitrana

  • Affiliations:

  • Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain;Research Group in Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain

  • Venue:
  • PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

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.