0

857views

The Polynomial Time

written 7.0 years ago by teamques10 ★ 70k

analysis of algorithms

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

0views

written 7.0 years ago by teamques10 ★ 70k

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is for some nonnegative integer , where is the complexity of the input. Polynomial-time algorithms are said to be "fast."

ADD COMMENT SHARE EDIT