Whose thesis states that the solution to a problem is solvable with reasonable resources assuming it allows for a polynomial time algorithm?
If T(n) is a polynomial in n, then the algorithm is said to be a polynomial time algorithm.