np complete np p and np hard

P - can be solved in polynomial time (by deterministic machine)
NP - can be solved by a non deterministic machine in polynomial time
NP-Complete - its NP and reducible in polynomial time to another NP-Complete problem, yes its circular :/ hell i dont know why.
NP-Hard - the problem is at least as hard as an NP-Complete problem.