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
Answered by Henry B. Computing tutor

7327 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What is the point of an Operating System?


What is the time complexity of Bubble Sort?


Describe the difference between a CPU and a GPU with relation to processing power and ability to perform tasks.


Explain indexed addressing including the benefits when traversing certain data structures (4 Marks)


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

MyTutor is part of the IXL family of brands:

© 2026 by IXL Learning