polynomial time
"Polynomial time" is a crucial concept in computational complexity theory, used to describe algorithms that run efficiently relative to the input size.
🇺🇸 US Voice:
🇬🇧 UK Voice:
Definition
C1Computational Complexity
(technical, academic)The time complexity of an algorithm that can be expressed as a polynomial function of the input size.
Example
- The sorting algorithm runs in polynomial time, making it efficient for large datasets.
- Problems solvable in polynomial time are considered tractable in computer science.
C1Computational Efficiency
(technical, academic)A measure indicating that the number of steps an algorithm takes is bounded by a polynomial expression in the size of the input.
Example
- Algorithms with polynomial time complexity are preferred for their scalability.
Similar
Terms that have similar or relatively close meanings to "polynomial time":