Live briefing
Everything about Decision problem
Yes/no problem in computer science
In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question on a set of input values. An example of a decision problem is deciding whether a given natural number is prime. Another example is the problem, "given two numbers x and y, does x evenly divide y?" Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Decision problemA 5-minute orientation
- Skim a recent paper: Learning-based multi-objective evolutionary algorithm for batching decision problemInfluential work since 2022
- Pick up a classic book: Contemporary Strategy AnalysisThe most-reprinted book on the subject
- Read the landmark paper: Decision Making and Problem SolvingCited 168 times
- Go sideways: Reduction (complexity)A closely related topic
- Go sideways: Computational problemA closely related topic
📖 Definitions
Noun A question in some formal system with a yes-or-no answer, depending on the values of input parameters.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Decision Making and Problem Solving
Program evaluation as a decision problem
Decision‐Support System for Modeling Bid/No‐Bid Decision Problem
The decision problem for standard classes
Decision problem structuring: generating options
A Renewal Decision Problem
Dynamic decision problem structuring
Clinical Problem Solving and Decision Psychology
🆕 Influential since 2022
Learning-based multi-objective evolutionary algorithm for batching decision problem
Multi-criteria decision-making approaches for aircraft-material selection problem
Decision support for the technician routing and scheduling problem
The effect of problem-solving and decision-making education on problem-solving and decision-making skills of nurse managers: A randomized controlled trial
What is a decision problem?
📚 Books worth reading
Contemporary Strategy AnalysisRobert M. Grant · 2010
Thinking courseEdward de Bono · 1982
Creative problem solving for managersTony Proctor · 1999
The Power of Focused ThinkingEdward de Bono, Feng yang · 1981
The Innovator's DilemmaClayton M. Christensen, L J Ganser · 1997
Fundamentals of financial managementEugene F. Brigham, Joel F. Houston · 1978
Crucial ConversationsKerry Patterson, Joseph Grenny · 2001
The undoing projectMichael Lewis, Dennis Boutsikaris · 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Reduction (complexity) In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. A sufficiently…
- Computational problem In theoretical computer science, a problem is one that asks for a solution in terms of an algorithm. For example, the problem of factoring "Given a positive…
- Undecidable problem In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct…
- Turing reduction In computability theory, a Turing reduction from a decision problem A to a decision problem B is an oracle machine that decides problem A given an oracle…
- Oracle machine In complexity theory and computability theory, an oracle machine is an abstract machine that can query a black box called an oracle, which is able to give…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- Halting problem In computability theory, the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program…
- Many-one reduction In computability theory and computational complexity theory, a many-one reduction (also called mapping reduction) is a reduction that converts instances…