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: What hypothesis is associated with the complexity class of P viewed as a mathematical abstraction with efficient algorithmic functionality?
answers.text: Cobham–Edmonds thesis Cobham–Edmonds thesis Cobham–Edmonds thesis