1,088 views
0 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!

2 Answers

Position:
Show:

Related questions

0 0 votes
2 2 answers
3.5k
3.5k views
LavTheRawkstar asked Mar 26, 2017
3,450 views
what i have tried to get out the conslusion for P problem is that P problemThese are set of those yes/no problems which can solved using polynomic time complexity algroi...
0 0 votes
1 1 answer
1.8k
1.8k views
rahul sharma 5 asked Apr 16, 2018
1,831 views
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 cas...
1 1 vote
2 2 answers
2.6k
2.6k views
akankshadewangan24 asked Jun 20, 2017
2,570 views
P and NP concepts are there in gate syllabus?????????????????????????????????????????????
0 0 votes
0 0 answers
450
450 views