Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,174,431 papers from all fields of science
Search
Sign In
Create Free Account
Decision problem
Known as:
Solvable
, Decision variant
, Decidability problems
Expand
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
Create Alert
Alert
Related topics
Related topics
50 relations
AWPP (complexity)
Advice (complexity)
Approximation-preserving reduction
Arthur–Merlin protocol
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Grey Wolf Optimizer
S. Mirjalili
,
S. Mirjalili
,
A. Lewis
Adv. Eng. Softw.
2014
Corpus ID: 15532140
Highly Cited
2005
Highly Cited
2005
Generalized finite automata theory with an application to a decision problem of second-order logic
J. Thatcher
,
J. Wright
Mathematical systems theory
2005
Corpus ID: 31513761
Many of the important concepts and results of conventional finite automata theory are developed for a generalization in which…
Expand
Highly Cited
2001
Highly Cited
2001
Bayesian Networks and Decision Graphs
F. V. Jensen
Statistics for Engineering and Information…
2001
Corpus ID: 42979791
Probabilistic graphical models and decision graphs are powerful modeling tools for reasoning and decision making under…
Expand
Highly Cited
1995
Highly Cited
1995
On the Complexity of Solving Markov Decision Problems
M. Littman
,
T. Dean
,
L. Kaelbling
UAI
1995
Corpus ID: 2080151
Markov decision problems (MDPs) provide the foundations for a number of problems of interest to AI researchers studying automated…
Expand
Highly Cited
1994
Highly Cited
1994
A Theory of Timed Automata
R. Alur
,
D. Dill
Theor. Comput. Sci.
1994
Corpus ID: 18129339
Highly Cited
1993
Highly Cited
1993
The Classical Decision Problem
E. Börger
,
E. Grädel
,
Y. Gurevich
Perspectives in Mathematical Logic
1993
Corpus ID: 8621963
1. Introduction: The Classical Decision Problem.- 1.1 The Original Problem.- 1.2 The Transformation of the Classical Decision…
Expand
Highly Cited
1982
Highly Cited
1982
The Byzantine Generals Problem
L. Lamport
,
R. Shostak
,
M. C. Pease
TOPL
1982
Corpus ID: 55899582
Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the…
Expand
Highly Cited
1961
Highly Cited
1961
Decision problems of finite automata design and related arithmetics
C. C. Elgot
1961
Corpus ID: 119721061
1. Motivation. Many variants of the notion of automaton have appeared in the literature. We find it convenient here to adopt the…
Expand
Highly Cited
1959
Highly Cited
1959
Finite Automata and Their Decision Problems
M. Rabin
,
D. Scott
IBM J. Res. Dev.
1959
Corpus ID: 3160330
Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-tape automaton defines a set…
Expand
Highly Cited
1953
Highly Cited
1953
Classes of recursively enumerable sets and their decision problems
H. Rice
1953
Corpus ID: 120980829
1. Introduction. In this paper we consider classes whose elements are re-cursively enumerable sets of non-negative integers. No…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE