Computer Science, asked by Olabcibanubhil, 1 year ago

what is tractable problem

Answers

Answered by Shiv198Raven

Tractable Problem: a problem that is solvable by a polynomial-time algorithm. The upper bound is polynomial. Intractable Problem: a problem that cannot be solved by a polynomial-time al- gorithm. The lower bound is exponential.

Previous Question

Next Question

Similar questions

English, 7 months ago

31. LETTER TO SISTER TELLING HER ABOUT MEETING AN OLD FRIEND While travelling in a train, on your way to Mumbai last week, you suddenly met a friend of yours after 10 years. Write a letter to your sister telling her how excited both of you had felt and the different things you had talked about. (You are Aftab Dey who is staying at 144, Jamshedji Road, Mumbai) (CBSE SP 1990)...

Environmental Sciences, 7 months ago

The mongoose is praised in Indian culture and hated in Hawaiian culture. Why is this animal perceived differently in these environments?

Math, 7 months ago

If tan(x-y) /2,tan z, tan(x+y) /2 are in G. P. prove that cos x=cosy*cos2z...

Social Sciences, 1 year ago

What is existence farming...

Hindi, 1 year ago

Mumbai ki rajdhani kya he...

English, 1 year ago

character sketch of all in novel three men in boat...

English, 1 year ago

essay on mushrooming of old age home...

Science, 1 year ago

when a bicycle moves a rectilinear motion and periodic motion takes a place simultaneously. justify...