Problems that can be solved in polynomial time are known as?
(a) intractable
(b) tractable
(c) decision
(d) complete
The question was asked during an internship interview.
The doubt is from Checksum, Complexity Classes & NP Complete Problems topic in portion Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II