context: The complexity class P is often seen as a mathematical abstraction modeling those computational tasks that admit an efficient algorithm. This hypothesis is called the Cobham–Edmonds thesis. The complexity class NP, on the other hand, contains many problems that people would like to solve efficiently, but for which no efficient algorithm is known, such as the Boolean satisfiability problem, the Hamiltonian path problem and the vertex cover problem. Since deterministic Turing machines are special non-deterministic Turing machines, it is easily observed that each problem in P is also member of the class NP.
question: কোন জটিলতা শ্রেণীটি সাধারণত দ্রাব্যতা বাড়ানোর জন্য অজানা অ্যালগরিদম দ্বারা চিহ্নিত করা হয়?
answers: NP NP NP