User:Jangradeepak/Books/DNA COMPUTING

DNA COMPUTING

 * Algorithm


 * DNA
 * DNA computing
 * Biocomputer
 * Killer application
 * Parallel computing
 * Turing machine
 * Non-deterministic Turing machine
 * Hamiltonian path
 * Hamiltonian path problem
 * Travelling salesman problem


 * P and NP
 * Complexity class
 * P (complexity)
 * NP (complexity)
 * NP-intermediate
 * Strongly NP-complete
 * NP-complete
 * NP-hard
 * List of NP-complete problems
 * P versus NP problem
 * Time complexity
 * Computational complexity theory


 * SAT
 * Sharp-SAT
 * Unsatisfiable core
 * Boolean satisfiability problem
 * Satisfiability Modulo Theories
 * Circuit satisfiability problem


 * Maximum Clique
 * Clique (graph theory)
 * Karloff–Zwick algorithm
 * Decision problem