Algorithmic complexity: Difference between revisions
Content deleted Content added
| Line 1: | Line 1: | ||
'''Algorithmic complexity''' may refer to: |
'''Algorithmic complexity''' may refer to: |
||
* In [[algorithmic information theory]], the complexity of a particular string, in terms of all algorithms that generate it. |
* In [[algorithmic information theory]], the complexity of a particular string, in terms of all algorithms that generate it. |
||
** [[Kolmogorov–Chaitin complexity]], the most widely |
** [[Kolmogorov–Chaitin complexity]], the most widely used such measure. |
||
* In [[analysis of algorithms]], the complexity of a particular algorithm. |
* 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. |
* In [[computational complexity theory]], the complexity of a particular problem, in terms of all algorithms that solve it. |
||
{{ |
{{disambiguation}} |
||
Revision as of 11:24, 27 June 2016
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 disambiguation page lists articles associated with the title Algorithmic complexity.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
If an internal link led you here, you may wish to change the link to point directly to the intended article.