Does this mean there is a relationship between the NP completeness of a problem and the worst case time complexity of algorithms which solve it?