tractable problem
Quick Summary
In computer science, a tractable problem is one that can be solved efficiently by a computer algorithm. This means the time or number of steps required to find a solution grows as a polynomial function of the problem's size, denoted as n. These are considered "easy" problems.
In contrast, intractable problems require time that grows exponentially with the problem size. These are considered "hard" or inefficient to solve. Many significant computer science problems, such as the traveling salesman problem, fall into the category of NP-complete problems, which are a class of problems for which no efficient algorithm has been found. Determining if these NP-complete problems are tractable or intractable is a major question in theoretical computer science.12
Ask Britannica AI about this topic
Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.
- NP-complete problem
So-called easy, or tractable, problems can be solved by computer algorithms that run in polynomial time; i.e., for a problem of size n, the time or number of steps needed to find the solution is a polynomial function of n. Algorithms for solving hard, or intractable, problems, on…
Read MoreSo-called easy, or tractable, problems can be solved by computer algorithms that run in polynomial time; i.e., for a problem of size n, the time or number of steps needed to find the solution is a polynomial function of n. Algorithms for solving hard, or intractable, problems, on…
Read More - P versus NP problem
…said to be easy, or tractable. A problem is called NP if its solution can be guessed and verified in polynomial time, and nondeterministic means that no particular rule is followed to make the guess.
Read More…said to be easy, or tractable. A problem is called NP if its solution can be guessed and verified in polynomial time, and nondeterministic means that no particular rule is followed to make the guess.
Read More