cRha8y0etatormero
cRha8y0etatormero cRha8y0etatormero
  • 15-08-2016
  • Mathematics
contestada

What is the difference between tractable, intractable and unsolvable algorithms?

Respuesta :

Hussain514 Hussain514
  • 19-08-2016
Tractable refers to that how hard is problem
Tractable are those that can be solved in a polynomial time
where as the intractable are those which can be solved  by using large time
whereas unsolvable are those which cannot be solved and requires infinite amount of time
hope it helps
Answer Link

Otras preguntas

Sharlene is supposed to poll people about their voting choices for her american government class. she asks four random people on the street about their vote and
PLEASE HELP!!! ASAP!!!
ANSWER PLZ QUICK AND FAST
Between what two consecutive integers does the square root of 128 lie?Between what two consecutive integers does lie? a.-13 and -12 b.-12 and -11 c.-11 and -
GEOMETRIC PROBABILITY AID?
Which is an indication that a man might be choking
SURFACE AREAS - PYRAMIDS?
I need 1-4 Answered asap
write an inequality that represnts the graph below. use x as your variable.
The gym offers a discount when more than one member of the family joins. The first member (n=0) pays $550 per year. The second member to join (n=1) gets a disco