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

6194 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

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


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


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.


What is the difference between CISC and RISC?


We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences