Truth-table reduction
Summary
In computability theory, a truth-table reduction is a type of reduction from a decision problem to a decision problem . To solve a problem in , the reduction describes the answer to as a boolean formula or truth table of some finite number of queries to .
Further reading
- Wikipedia, page 2695407, revision 1336381539, Truth-table reduction. adopted
About this page
| Tag | 6EKNWDARWZ |
|---|---|
| URI | m2://6EKNWDARWZ |
| Aliases | bounded-turing-reduction, tt-reduction, weak-truth-table-reduction, wtt-reduction |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.