Time complexity: the classes P and NP

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


Church’s thesis states that a function is computable iff it is recursive. A classical observation shows that some recursive functions require time of order O(22 2 n ) on inputs of size n. Such functions are not computable by any procedure producing an output in a reasonable time if n ≥ 10. Restrictions are needed to model the notion of effective computability.


Polynomial Time Turing Machine Vertex Cover Computation Tree Global Relation 
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