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 1Computational complexity theoryBroader topic: Complexity classes are often defined first for problems with yes-or-no answers.NP-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.Computable functionRelated: Its characteristic function is computable exactly when the problem is decidable.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.NP-hardnessRelated: NP is defined for decision problems, even when the target of a reduction is broader.Undecidable problemNarrower topic: Undecidability is a property of decision problems, not of arbitrary questions as phrased.Existence theoremCompared with: Knowing that a solution exists does not necessarily decide how to find or recognize one.Hilbert's problemsRelated: Hilbert's tenth problem asks whether integer polynomial solvability has such a procedure.Nondeterministic Turing machineRelated: Machine acceptance provides a formal way to decide yes-instances.Oracle Turing machineRelated: An oracle query asks precisely whether an input has a yes answer for a fixed problem.Quantifier eliminationRelated: Effective elimination can provide a decision procedure for a theory.Graph isomorphism problemNarrower topic: Each graph pair receives one of two answers: isomorphic or not.Mathematical problemBroader topic: Some mathematical problems ask only whether a specified condition can be met.Savitch's theoremRelated: The theorem compares which yes-or-no problems machines can solve within space bounds.Theory of computationRelated: Decidability and complexity classify which yes-or-no problems machines can solve.Hartmanis–Stearns conjectureNarrower topic: P and NP are defined as classes of decision problems.
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 1Computational complexity theoryBroader topic: Complexity classes are often defined first for problems with yes-or-no answers.NP-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.Computable functionRelated: Its characteristic function is computable exactly when the problem is decidable.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.NP-hardnessRelated: NP is defined for decision problems, even when the target of a reduction is broader.Undecidable problemNarrower topic: Undecidability is a property of decision problems, not of arbitrary questions as phrased.Existence theoremCompared with: Knowing that a solution exists does not necessarily decide how to find or recognize one.Hilbert's problemsRelated: Hilbert's tenth problem asks whether integer polynomial solvability has such a procedure.Nondeterministic Turing machineRelated: Machine acceptance provides a formal way to decide yes-instances.Oracle Turing machineRelated: An oracle query asks precisely whether an input has a yes answer for a fixed problem.Quantifier eliminationRelated: Effective elimination can provide a decision procedure for a theory.Graph isomorphism problemNarrower topic: Each graph pair receives one of two answers: isomorphic or not.Mathematical problemBroader topic: Some mathematical problems ask only whether a specified condition can be met.Savitch's theoremRelated: The theorem compares which yes-or-no problems machines can solve within space bounds.Theory of computationRelated: Decidability and complexity classify which yes-or-no problems machines can solve.Hartmanis–Stearns conjectureNarrower topic: P and NP are defined as classes of decision problems.