Complexity of problems and algorithms



Complexity theory proposes a set of results and methods to evaluate the intrinsic complexity of the problems. A problem belongs to a class of complexity, which informs us of the complexity of the “best algorithm” able to solve it. Complexity theory brings our attention to decision problems, and is based on languages theory and Turing machines. The reader interested in a very detailed presentation of complexity theory is referred to [Garey and Johnson, 1979] or [Papadimitriou, 1995].


Schedule Problem Polynomial Time Decision Problem Turing Machine Complexity Theory 
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 Berlin Heidelberg 2002

Authors and Affiliations

  1. 1.Laboratoire d’InformatiqueUniversité François-Rabelais ToursToursFrance

Personalised recommendations