Category:Algorithmic Complexity
Jump to navigation
Jump to search
This category contains results about Algorithmic Complexity.
Definitions specific to this category can be found in Definitions/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 the following 2 subcategories, out of 2 total.
E
- Exponential Time (empty)