A problem or algorithm with at most polynomial time complexity is considered tractable (or feasible ). P is the set of all tractable problems. • A problem or algorithm that has more than polynomial complexity is considered intractable (or infeasible ) .