I was learning about algorithms with polynomial time complexity. I found the following algorithms interesting.
Linear Search - with time complexity $O(n)$
Matrix Addition - with time complexity $O(n^2)$
Matrix Multiplication - with time complexity $O(n^3)$
Is there any algorithm with a higher complexity like $n^4$, $n^5$ etc? I would like to know about practical algorithms with polynomial time complexity only.
(I am familiar with algorithms having exponential complexity and class NP algorithms. My doubt is not about them.)