Complexity: time and space

  • Richard Lassaigne
  • Michel de Rougemont
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)


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.


Turing Machine Complexity Class Computation Tree Symmetric Graph Hamiltonian Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2004

Authors and Affiliations

  • Richard Lassaigne
    • 1
  • Michel de Rougemont
    • 2
  1. 1.Maitre de ConferencesUniversity Paris VIIFrance
  2. 2.University Paris IIFrance

Personalised recommendations