Log In
0 votes
I am having difficulty in understanding np and np-hard topic in algorithms. If someone can provide some good source to learn about it in easy manner it would be a real help.

Thank you!
in Algorithms 177 views

2 Answers

0 votes
0 votes

Related questions

0 votes
2 answers
what i have tried to get out the conslusion for P problem is that P problem These are set of those yes/no problems which can solved using polynomic time complexity algroithms. For example if are asked to Compare or sort then numbers.Then using loop we can solve and thus we can also ... fact can be verified.hence this Np problem is now P problem Am i correct with these two terms ????????????????
asked Mar 26, 2017 in Algorithms LavTheRawkstar 934 views
0 votes
1 answer
Are NP-Hard problems Semi decidable or Decidable or not even semidecidable? I know NP class is decidable as there is polynomial time NTM.But in the following figure in case there are some NP hard problems that are lying outside of NP.Problems which are NP-hard but not NPC.Can these also be solved in polynomial time by NTM?
asked Apr 16, 2018 in Theory of Computation rahul sharma 5 410 views