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… (More)
DOI: 10.1007/978-3-540-31834-7_22


2 Figures and Tables

Slides referencing similar topics