polynomial time

Speech parts

1. polynomial time - Noun

2. polynomial time - Adjective

Meaning

polynomial time (uncountable)

(mathematics) The complexity class where the runtime can be bounded (from above) by a polynomial in the input size.

polynomial time (not comparable)

(mathematics) Of an algorithm, which terminates in polynomial time.

Alternative names

polynomial-time

Examples

A key reason for this belief is that after decades of studying these problems no one has been able to find a polynomial-time algorithm for any of more than 3000 important known NP-complete problems (see List of NP-complete problems ). Source: Internet

A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. Source: Internet

Arora & Barak (2009) p.118 NC is a subset of P because polylogarithmic parallel computations can be simulated by polynomial-time sequential ones. Source: Internet

Although this problem seems easier, Valiant and Vazirani have shown citation that if there is a practical (i.e. randomized polynomial-time ) algorithm to solve it, then all problems in NP can be solved just as easily. Source: Internet

For instance, given a context-free grammar, one can use the Chomsky Normal Form to construct a polynomial-time algorithm that decides whether a given string is in the language represented by that grammar or not (the CYK algorithm ). Source: Internet

Ellipsoid algorithm, following Khachiyan This is the first worst-case polynomial-time algorithm for linear programming. Source: Internet

Close letter words and terms