-1

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).

Community
  • 1
  • 1
red23jordan
  • 2,841
  • 10
  • 41
  • 57

1 Answers1

4

Polynomial time means that there exist a constant a, such that the complexity of your algorithm is O(n^a).

Here is an explanation about NP-hard.

Petar Ivanov
  • 91,536
  • 11
  • 82
  • 95