Final answer:
The true statement is that a problem is tractable according to the Cobham-Edmonds thesis if it can be solved by a polynomial-time algorithm.
Step-by-step explanation:
The correct statement is: c. According to the Cobham-Edmonds thesis, we call a problem tractable if there is an algorithm for solving it which has polynomial computational complexity. The Cobham-Edmonds thesis, also known as the Cobham's thesis, states that computational problems can be considered tractable if they can be solved by an algorithm that runs in polynomial time, which means the time to solve the problem increases polynomially with the input size. However, problems requiring exponential time are considered intractable, as the solution time grows too quickly for the problems to be solved in a practical amount of time as the input size grows.
The Cobham-Edmonds thesis states that a problem is considered tractable if there exists an algorithm that can solve it with a polynomial computational complexity. Therefore, statement c is TRUE. Statement a is FALSE because exponential computational complexity would make a problem intractable. Statement b is also FALSE because complexity is an important factor in determining if a problem is tractable. Statement d is also FALSE because linear computational complexity is not sufficient to determine if a problem is tractable.
Learn more about Cobham-Edmonds thesis