Exam-style question
Try this first
An algorithmic problem has a polynomial-time solution. How should the problem be classified?.
- A.Tractable
- B.Intractable
- C.Heuristic
- D.Unclassifiable
Model answer
What a good answer should say
- Tractable
Explanation
Why this works
Problems with a polynomial (or less) time solution are classified as tractable.
Common mistake
No common mistake is linked to this question yet.