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

5740 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

Represent the denary number 5.625 as an unsigned binary fixed point number with three bits before and five bits after the binary point.


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


Why are bit patterns often displayed in hexadecimal notation instead of binary notation?


Explain indexed addressing including the benefits when traversing certain data structures (4 Marks)


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