reduction between decision problems
C44232
concept
A reduction between decision problems is a systematic transformation that converts instances of one decision problem into instances of another such that solving the latter correctly also yields a correct solution to the former.
All labels observed (2)
| Label | Occurrences |
|---|---|
| reducibility notion | 1 |
| reduction between decision problems canonical | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: reduction between decision problems
Generated description
A reduction between decision problems is a systematic transformation that converts instances of one decision problem into instances of another such that solving the latter correctly also yields a correct solution to the former.
Instances (2)
| Instance | Via concept surface |
|---|---|
|
Karp reductions
surface form:
Karp reduction
|
— |
| Turing reducibility | reducibility notion |