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

6472 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

In decimal, what is the most negative number that can be represented using a 12-bit two’s complement binary integer?


Write pseudocode for the binary search algorithm and state, with an explanation, it's worst case complexity in big-O notation


Discuss the differences between operating systems designed for desktop computers and embedded systems.


What are firewalls? Explain and discuss three methods they employ to secure a network. [8]


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:

© 2025 by IXL Learning