Category:Definitions/Algorithmic Complexity
Jump to navigation
Jump to search
This category contains definitions related to Algorithmic Complexity.
Related results can be found in Category:Algorithmic Complexity.
The complexity of an algorithm is defined as the number of discrete steps needed to terminate as a function of the number of inputs.
Subcategories
This category has only the following subcategory.
E
- Definitions/Exponential Time (1 P)
Pages in category "Definitions/Algorithmic Complexity"
The following 3 pages are in this category, out of 3 total.