Background on Computational Complexity

Part of the Advanced Courses in Mathematics - CRM Barcelona book series (ACMBIRK)


In all instances, if not said otherwise, we use Turing machines as our principal model of computation. In this section we briefly recall some basic definitions and notation concerning Turing machines that are used throughout this chapter.


Polynomial Time Decision Problem Turing Machine Computational Problem Conjunctive Normal Form 
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

© Birkhäuser Verlag 2008

Personalised recommendations