radomes.openskiesproject.org
cRha8y0etatormero
cRha8y0etatormero cRha8y0etatormero
  • 15-08-2016
  • Mathematics
Answered

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

Verified Answer :

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

Related Questions

Which state demanded that the new constitution include a Bill of Rights New York Pennsylvania Rhode Island New Hampshire
Which organization helped back the United States during the Korean War 1 Point A NATO B United Nations C Soviet Union D League of Nations
why its important that skull joints cannot move
regla es amarilla
Which of these people did not benefit from the prosperity of the late 1800s Choose all answers that are correct A tenenment resident B steel magnate C stor owne
I need help on these two
Is 70 thousand written in standard form or word form Explain
46x2088 Solve for x Hurry Please but dont copy and paste
A number is doubled and then increased by seven The result is ninety three What is the origonal number
Which of the following cannot yet be done A Determine the genes of a child B accurately reconstruct complete strands of dinosaur DNA C use somatic cells to clon