Tractable Problem

algorithms

Definition

Tractable Problem

A problem is called tractable or efficiently solvable if it can be solved in polynomial time, meaning there’s an algorithm with a runtime of $O(n^c)$, where $n$ is the input size and $c$ is a constant exponent.