Polynomial time (English)
Search for " Polynomial time " in NRICH | PLUS | maths.org | Google
Definition (undergraduate level)
For a given algorithm which takes input data of length n, if we can find integers A and k such that the algorithm is always completed in at most Ank elementary operations, then the algorithm is said to run in polynomial time.
Relations
- broader:
- (en) Property of an algorithm
- referenced:
- (en) Exponential time
- (en) NP problem
- (en) P problem
- see also:
- (en) NP
Funded by: EU Socrates Minerva, HeyMath!, Cambridge University Press