Complexity: time and space
Complexity introduces a measure associated with algorithms described for a computation model. This measure allows us to express that a problem is more difficult than another one and to understand why certain problems are inherently difficult. Two classical measures are introduced: time, which measures the number of elementary steps necessary in an algorithm and space, which measures the size of the memory used. These two measures are asymptotic functions of the size of the data, as we explain for linear time.
KeywordsTuring Machine Complexity Class Computation Tree Symmetric Graph Hamiltonian Circuit
Unable to display preview. Download preview PDF.