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').

Answered by Henry B. Computing tutor

5513 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

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


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.


What are the benefits of using thin clients.


Why would you use Assembly Language instead of a normal programming language?


We're here to help

contact us iconContact usWhatsapp logoMessage us on Whatsapptelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo
Cookie Preferences