1) Explain the P vs. NP vs. NP-complete problem and why you, as a Computer Scientist, should care about it.
2) Explain how one can prove a problem to be NP-complete.
3) Choose an actual NP-complete problem and describe the steps to prove it is member of that class.
Hello
I am Algorithm expert and interested in this project. I have reviewed the details and confident to handle it perfectly.
Please communicate to discuss further.
Regards
Anshu