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

300 word essay explaining how economic developments between 1450-1750 affected social structures over time.
What part of the frankincense tree is used to make essential oil
meghan can shovel all the snow from the family drive way in 45 mins. it will take 30 minutes to completely shovel the drive way if she works together with her b
7th grade math. help
i peeled 21 oranges in 28 minutes how long would it take me to peel 15 oranges
The home you selected to buy is worth $924999. While the assessed value of your home may not be this same amount, you can estimate your annual property taxes us
جس کا کام اسی کو ساجے اخلاقی کہانی
How many liters of 4.0 M NaOH solution are needed to prepare 1.0 L of a 0.50 M NaOH solution
If f(x) = (1/7)(7*), what is ſ(3)?
(100 points on this) The figure shows a tank in the form of a rectangular prism that is 25% full of water. How many more gallons of water will it take to fill t