Wednesday, 10 August 2016

Theory of Computation Unit 5 (Tractable and Untractable Problems)

Tractable and Untractable Problems: P, NP, NP complete and NP hard problems, examples of these problems like satisfy ability problems, vertex cover problem, Hamiltonian path problem, traveling sales man problem, Partition problem etc.

No comments:

Post a Comment