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

7479 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

What is the difference between local and global variables?


Write a small program, in pseudocode or otherwise, that demonstrates a recursive algorithm. Write a small explanation of how recursion is used in your program.


One member of a chess club sends a text file saved in Unicode. What meant by the term "Unicode" and why might this be necessary?


Convert the base-10 number 74 into an 8-bit binary number


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