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

4373 Views

See similar Computing A Level tutors

Related Computing A Level answers

All answers ▸

How can the idea of precondtioning as part of 'Thinking Ahead' benefit a programmer when writing code?


In programming, some languages are compiled and others are interpreted. Define the difference between the two.


Given a graph with n nodes and m edges, every edge has a passing cost that can be negative, find the minimum distance between node 1 and every other node


What is the decimal equivalent of the following sequence of bits, which represents an unsigned binary integer: 1101001. What is the decimal equivalent if the sequence in bits encodes a two’s complement binary integer.


We're here to help

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

© MyTutorWeb Ltd 2013–2024

Terms & Conditions|Privacy Policy