Computer Science, asked by mounikabalagani999, 8 months ago

Problems that can be solved in polynomial
time are known as
a) intractable
b) tractable
c) decision
d) complete

Answers

Answered by mKalki

0

Answer:

(b) tractable

Explanation:

mark as brainlist

Previous Question

Next Question

Similar questions

History, 4 months ago

औरंगजेब की मृत्यु कब हुई ? (A) 1707 (B) 1507 (C) 1607 (D) 1807...

English, 4 months ago

k=|r'_×r''_|÷|r'_| what is the solution of this question ...

Computer Science, 4 months ago

What is a word processor ? write four important features of word processor.

Hindi, 8 months ago

4.भारते कस्याः नद्या: तटे विकसिता सभ्यता आसीत ?

Psychology, 8 months ago

तर्क की परिभाषा दीजिए एवं उनके प्रकारों का विवरण दीजिए...

Accountancy, 1 year ago

Suppose your dependent variable (profit) takes values of high profit (profit > rs 1,35,000) or low profit: in such case what type of regression model would you like to use and why?

Computer Science, 1 year ago

Suppose two jobs, each of which needs 10 minutes of cpu time, start simultaneously. Assume 50% i/o wait time. How long will it take for both to complete, if they run sequentially?

Computer Science, 1 year ago

Suppose we have a system that is composed of two blocks, with the first block having a gain a=10 and an input ip3 of aip3,1=1 and the second block having a gain of b=2 and input ip3 of aip3,2=1.Calculate input ip3 for whole system.Redrive the iip3 of the system if order of the blocks is reversed...