Category:Definitions/Polynomial Time
Jump to navigation
Jump to search
This category contains definitions related to Polynomial Time.
Related results can be found in Category:Polynomial Time.
Polynomial time is a measure of algorithmic complexity.
An algorithm runs in polynomial time if and only if:
- there exist integers $A$ and $k$ such that, for $n$ inputs, the algorithm terminates in no more than $A n^k$ steps.
Subcategories
This category has only the following subcategory.
T
- Definitions/Type P Problems (1 P)
Pages in category "Definitions/Polynomial Time"
The following 3 pages are in this category, out of 3 total.