AI engineering glossary · Data structures algorithms
What is polynomial time?
Polynomial time: Running time bounded by n raised to some fixed power, such as n, n^2 or n^3. Problems solvable this way are considered practically tractable, in contrast to exponential time, which becomes impossible even for moderate n.
Polynomial time: an example
An O(n^2) algorithm handles 10,000 items in about 10^8 steps, while an O(2^n) algorithm is hopeless beyond roughly 50 items.
Related terms
More Data structures algorithms terms
Where you learn it
Polynomial time is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.