9 Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman’s techniques could be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). In this paper, it is proved how the D...

Adleman wrote the first paper in which it is shown that deoxyribonucleic acid (DNA) strands could be employed towards calculating solutions to an instance of the NP-complete Hamiltonian path problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to solve the NP-complete satisfiability (SAT) problem (the first NP-complete problem). In this paper, it is proved how the DNA...

We introduce the fast-mixed search model, which is a combination of the fast search model and the mixed search model. We establish relations between the fast-mixed search problem and other graph search problems. We also establish relations between the fast-mixed search problem and the inducedpath cover problem. We present linear-time algorithms for computing the fast-mixed search number and opt...

In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.

Subset Sum Problem (SSP) is an NP Complete problem which finds its application in diverse fields. The work suggests the solution of above problem with the help of genetic Algorithms (GAs). The work also takes into consideration, the various attempts that have been made to solve this problem and other such problems. The intent is to develop a generic methodology to solve all NP Complete problems...

The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Chvátal studied this problem under the name of the Decomposable Graph Recognition problem, and proved the problem to be NP-complete for graphs with maximum degree 4, and gave a polynomial algorithm for graphs with maximum degree 3. Recently, unaware of Chvátal’s result, Patrignani and Pizz...

There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the satisfiability problem for all logics betweenK andS4 is PSPACE-hard, while forS5 it is NP-complete. We show that it is negative introspection, the axiom ¬Kp ⇒ K¬Kp, that causes the gap: if we add this axiom to any modal logic bet...

Maximum Clique Problem (MCP) is an NP Complete problem which finds its application in diverse fields. The work suggests the solution of above problem with the help of Genetic Algorithms (GAs). The work also takes into consideration, the various attempts that have been made to solve this problem and other such problems. The intend is to develop a generic methodology to solve all NP Complete prob...