- polynomial time
**1.**nountime complexity which is bounded by some polynomial**2.**adjective(Of an algorithm) which enjoys polynomial time

*Wikipedia foundation.*

### Look at other dictionaries:

**Polynomial time**— In computational complexity theory, polynomial time refers to the computation time of a problem where the run time, m ( n ), is no greater than a polynomial function of the problem size, n .Written mathematically using big O notation, this states … Wikipedia**polynomial time**— … Useful english dictionary**Polynomial-time approximation scheme**— In computer science, a polynomial time approximation scheme (abbreviated PTAS) is a type of approximation algorithm for optimization problems (most often, NP hard optimization problems).A PTAS is an algorithm which takes an instance of an… … Wikipedia**Polynomial-time reduction**— In computational complexity theory a polynomial time reduction is a reduction which is computable by a deterministic Turing machine in polynomial time. If it is a many one reduction, it is called a polynomial time many one reduction, polynomial… … Wikipedia**Pseudo-polynomial time**— In computational complexity theory, a numeric algorithm runs in pseudo polynomial time if its running time is polynomial in the numeric value of the input (which is exponential in the length of the input its number of digits).An ExampleConsider… … Wikipedia**Almost Wide Probabilistic Polynomial-Time**— In theoretical computer science, Almost Wide Probabilistic Polynomial Time (AWPP) is a complexity class for problems in the context of quantum computing.AWPP contains the BQP (Bounded error, Quantum, Polynomial time) class, which contains the… … Wikipedia**Time complexity**— In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia**Polynomial hierarchy**— In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial … Wikipedia**Polynomial**— In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia**Polynomial space**— In computational complexity theory, polynomial space refers to the space required in computation of a problem where the space, m ( n ), is no greater than a polynomial function of the problem size, n .Written mathematically, m ( n ) = O( n k )… … Wikipedia