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

7583 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What is the difference between local and global variables?


Explain how the fetch execute cycle works? Include the specific registers and buses being used


Describe the process of a binary search.


why is the Harvard architecture is sometimes used in preference to the von Neumann architecture and give examples of each system


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