
522 Design and Analysis of Algorithms
Exercises
7. Reductions see Key Terms in Chapter 17.
8. SAT is a decision problem. An instance of
the problem is a Boolean expression written
using only AND, OR, NOT, variables, and
parentheses. The question is: Given the
expression, is there some assignment of
TRUE and FALSE values to the variables that
will make the entire expression true?
9. Satisfi ability see SAT above.
10. Turing machine is extremely basic symbol-
manipulating device which, despite its simplic-
ity, can be adapted to simulate the logic of any
computer that could possibly be constructed. It
was described in 1936 by Alan Turing. ...