KnowraDecision problemLinked fromLinked fromThe 20 pages that link to Decision problem, each with the reason it gives.All 20Broader topic 2Related 8Narrower topic 9Compared with 1NP-completenessNarrower topic: The standard definition of NP-completeness applies to decision problems.P versus NP problemNarrower topic: P and NP classify decision problems rather than arbitrary tasks directly.EntscheidungsproblemNarrower topic: The Entscheidungsproblem asks whether validity forms a decidable problem.Polynomial-time reductionNarrower topic: Answer preservation is defined between these yes-or-no problems.Many-one reductionNarrower topic: Many-one reductions compare decision problems by mapping their inputs.DecidabilityNarrower topic: Decidability classifies decision problems by whether one algorithm always answers correctly.Undecidable problemNarrower topic: Undecidability is a property of decision problems, not of arbitrary questions as phrased.Graph isomorphism problemNarrower topic: Each graph pair receives one of two answers: isomorphic or not.Hartmanis–Stearns conjectureNarrower topic: P and NP are defined as classes of decision problems.