Exam-style question
Try this first
Which description best defines a tractable problem?.
- A.A problem with a polynomial (or less) time solution
- B.A problem that always requires a heuristic method
- C.A problem with no possible algorithmic solution
- D.A problem whose solution time must be exponential
Model answer
What a good answer should say
- A problem with a polynomial (or less) time solution
Explanation
Why this works
Tractable problems are those for which a polynomial (or less) time solution exists.
Common mistake
No common mistake is linked to this question yet.
