Definition
Tractable Problem
A problem is called tractable or efficiently solvable if it is decidable polynomial time, meaning there’s an algorithm with a runtime of
, where is the input size and is a constant exponent independent from .
Tractable Problem
A problem is called tractable or efficiently solvable if it is decidable polynomial time, meaning there’s an algorithm with a runtime of
, where is the input size and is a constant exponent independent from .