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

7143 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?


Write a Pseudocode function that returns the factorial of an integer input.


Describe two's complement.


A common construct found in many algorithms is a loop. Using pseudocode, write a pre-condition loop to output all of the even numbers between 99 and 201.


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