How practically useful is an algorithm with the run time complexity of O(N^4)?

How practically useful is an algorithm with the run time complexity of O(N^4)?

How practically useful is an algorithm with the run time complexity of O(N^4)?



  1.     Not very useful because it gets slow even with moderately large input sequences
  2.     Very useful because its run time complexity is polynomial
  3.     Not very useful because it is NP-hard
  4.     Useful but only if N is larger than 1,000