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

7155 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

How do I solve a Karnaugh Map?


What are higher order functions in functional programming? How does the 'map' function work and why is it a higher order function?


Describe the process of a binary search.


What is the difference between compile-time errors and runtime errors?


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