Truth table reduction
From Wikipedia, the free encyclopedia
In computability theory truth table reduction is a reduction which is stronger than many-one reduction but weaker than Turing reduction.
A Turing reduction from a set A to a set B solves each question by asking the oracle B a finite number of questions
. The question
can depend on the answer of the previous question
. In a truth table reduction on the other hand the question
only depend on
.
[edit] Properties
, many-one reducibility implies truth table reducibility
, truth table reducibility implies Turing reducibility