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

6880 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

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


Explain how a stack could be used in the process of evaluating an expression in Reverse Polish notation.


Write pseudocode for the linear search algorithm, and then explain it’s complexity using big-O notation


How do I solve a Karnaugh Map?


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