In computability theory, a truth-table reduction is a type of reduction from a decision problem A {\displaystyle A} to a decision problem B {\displaystyle B} . To solve a problem in A {\displaystyle A} , the reduction describes the answer to A {\displaystyle A} as a boolean formula or truth table of some finite number of queries to B {\displaystyle B} .
In computability theory, a truth-table reduction is a type of reduction from a decision problem A {\displaystyle A} to a decision problem B {\displaystyle B} . To solve a problem in A {\displaystyle A} , the reduction describes the answer to A {\displaystyle A} as a boolean formula or truth table of some finite number of queries to B {\displaystyle B} .
Source: Wikipedia "Truth-table reduction" · CC BY-SA 4.0
Share this article: X · Bluesky