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 ...

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association ...

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… ...

Non-Deterministic Polynomial-Time (NP) Problems: In contrast, NP problems are significantly more challenging.

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's p – 1 algorithm, which finds in ...

L0-RBCS is a non-deterministic polynomial-time (NP)-hard combinatorial problem that uses sparse regularization with L0-norm for regression analysis under the constraint of maximum zero elements ...

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 ...