An information theoretic measure of algorithmic complexity
This work is a study of an information theoretic model which is used to develop a complexity measure of an algorithm. The measure is defined to reflect the computational cost and structure of the given algorithm. In this study computational costs are expressed as the execution times of the algorithm...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2429/19034 |