Algorithmic complexity

Algorithmic complexity may refer to:

In algorithmic information theory, the complexity of a particular string, in terms of all algorithms that generate it.
- Kolmogorov–Chaitin complexity, the most widely used such measure.
In analysis of algorithms, the complexity of a particular algorithm.
In computational complexity theory, the complexity of a particular problem, in terms of all algorithms that solve it.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.