Polynomial-time algorithm
= Polynomial-time algorithm
An algorithm runs in polynomial time if its worst-case running time is bounded by a fixed polynomial in the input length. Arithmetic with fixed-degree algebraic numbers also needs polynomial bit cost when used in such a guarantee. The <Edmonds–Karp algorithm> and the <method of conditional probabilities> with efficiently computable <clause> expectations are examples.