In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms… ...

At the same time, progress in invariant theory has contributed significantly to the development of deterministic algorithms by establishing concrete polynomial degree bounds for matrix invariants ...

Lu Lu, Marc E. Posner, An Np-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity, Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 12-38 ...