Solvable in Polynomial Time
← Back to P
A problem is in class P if there exists an algorithm that solves it in O(n^k) time for some constant k. Problems in P are considered tractable or efficiently solvable. Examples include sorting, shortest path, and linear programming.