Background on Computational Complexity
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.
KeywordsPolynomial Time Decision Problem Turing Machine Computational Problem Conjunctive Normal Form
Unable to display preview. Download preview PDF.