Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Decision problem

Known as: Solvable, Decision variant, Decidability problems 
In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes-or-no answer… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s to a tool for building real systems… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We introduce a class of MPDs which greatly simplify Reinforcement Learning. They have discrete state spaces and continuous… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Many of the important concepts and results of conventional finite automata theory are developed for a generalization in which… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In an online decision problem, one makes a sequence of decisions without knowledge of the future. Each period, one pays a cost… Expand
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Probabilistic graphical models and decision graphs are powerful modeling tools for reasoning and decision making under… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A study on the steps to follow in linguistic decision analysis is presented in a context of multi-criteria/multi-person decision… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Q: I did? Well, there is no doubt in my mind that feasibility is the real issue, but I keep bumping into the classical decision… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We identify the computational complexity of the satisfiability problem for FO2, the fragment of first-order logic consisting of… Expand
Is this relevant?
Highly Cited
1959
Highly Cited
1959
Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-tape automaton defines a set… Expand
Is this relevant?
Highly Cited
1953
Highly Cited
1953
1. Introduction. In this paper we consider classes whose elements are re-cursively enumerable sets of non-negative integers. No… Expand
Is this relevant?