Solving 3CNF-SAT and HPP in Linear Time Using WWW

We propose linear time solutions to two much celebrated NP-complete problems, namely the 3CNF-SAT and the directed Hamiltonian Path Problem (HPP), based on AHNEPs having all resources (size, number of rules and symbols) linearly bounded by the size of the given instance. Surprisingly enough, the time for solving HPP does not depend on the number of edges of the given graph. Furthermore, the algorithm for solving 3CNF-SAT we discuss here provides all solutions, if any, of the given instance of 3CNF-SAT. Finally, we discuss a possible real life implementation, not of biological inspiration as one may expect according to the roots of AHNEPs, but using the facilities of the World Wide Web.

• Type: Conference
• Year: 2004
• Where: MCU
• Authors: Florin Manea, Carlos Martín-Vide, Victor Mitrana
• Keywords: Hamiltonian Path Problem, Linear Time Solutions, MCU 2004, MCU 2007, NP-complete Problems