History, asked by estreraashantin5130, 4 months ago

How do you distinguish between tractable and intractable conflicts?

Answers

Answered by abhinav2618
0

Answer:

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.

Explanation:

please do follow me

Similar questions