The amount of time it takes for an algorithm to solve a polynomial function, which is a mathematical expression that does not contain fractions or negative numbers. The time is proportional to the ...

Polynomial Time Algorithm: An algorithm whose running time is upper bounded by a polynomial expression in the size of the input, considered efficient in computer science.

Ivan Kassal, Stephen P. Jordan, Peter J. Love, Masoud Mohseni, Alán Aspuru-Guzik, Polynomial-Time Quantum Algorithm for the Simulation of Chemical Dynamics, Proceedings of the National Academy of ...

Elegant algorithm Published 21 September 2002 From Cristian Calude I disagree with Nicola Dixon’s claim that “Experts had suspected a polynomial-time algorithm was possible” (17 August, p 9).

The problem of minimizing the total tardiness for a set of independent jobs on one machine is considered. Lawler has given a pseudo-polynomial-time algorithm to solve this problem. In spite of ...