Some problems are intractable. What does it mean for a problem to be described as intractable?

An intractable problem is a problem that is solvable, but not in polynomial time or less. Such problems cannot be solved in time considered to be reasonable (i.e. not solvable quick enough to be 'useful').

HB

Related Computing A Level answers

All answers ▸

What is 'Virtual Memory', and how does it work?


In Python, write a recursive function that returns the first n Fibonacci numbers.


Describe an IDE and its features in programming. (3 Marks)


What is the difference between a dynamic and a static data structure?