Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Possible Duplicate:
NP vs NP-Complete vs NP-Hard — what does it all mean?
Euler circuit problem can be easily solved in polynomial time
Hamilton circuit problem is proved to be NP-hard
nobody in the world can give a polynomial time algorithm for a NP-hard problem
What is meant by polynomial time and NP-hard? I know what is O(n).
Polynomial time means that there exist a constant
a, such that the complexity of your algorithm isO(n^a).Here is an explanation about
NP-hard.