Complexity of Algorithms and Software Metrics.
Mark Burgin, Narayan Chandra Debnath · Computers and Their Applications · 2003
The aim of this paper is to introduce a system structure in the diversity of algorithmic complexity measures for a study of computer software. We consider basic concepts and constructions from the theory of algorithmic complexity and develop a system structure in this theory, especially, for the axiomatic complexity theory. An important class of dual complexity measures is studied. We demonstrate how software metrics fit in the lattice of algorithmic complexity measures. Relations between software metrics and algorithmic complexity are analyzed.