Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,734,092 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
(opens in a new tab)
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
2009
Highly Cited
2009
Fountain codes over fading relay channels
Xi Liu
,
Teng Joon Lim
IEEE Transactions on Wireless Communications
2009
Corpus ID: 20368622
This paper discusses cooperative protocols based on fountain codes in a relay network. Unlike traditional fixed-rate codes…
Expand
Highly Cited
2007
Highly Cited
2007
Movement-Aware Vertical Handoff of WLAN and Mobile WiMAX for Seamless Ubiquitous Access
Wonjun Lee
,
Eunkyo Kim
,
Joongheon Kim
,
Inkyu Lee
,
Choonhwa Lee
IEEE transactions on consumer electronics
2007
Corpus ID: 20396986
This paper addresses a movement-aware vertical (MAV) handover algorithm between WLAN and Mobile WiMAX for seamless ubiquitous…
Expand
Highly Cited
2005
Highly Cited
2005
A Decomposition Rule for Decision Procedures by Resolution-Based Calculi
U. Hustadt
,
B. Motik
,
U. Sattler
Logic Programming and Automated Reasoning
2005
Corpus ID: 16218468
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of…
Expand
1997
1997
Imposing security constraints on agent-based decision support
L. Ekenberg
,
M. Danielson
,
M. Boman
Decision Support Systems
1997
Corpus ID: 6126696
Highly Cited
1995
Highly Cited
1995
Pareto process as a model of self-similar packet traffic
N. Jersey.
Proceedings of GLOBECOM '95
1995
Corpus ID: 118381325
In the past few years packet traffic from various sources-Ethernet, ISDN, CCSN and VBR video-has been shown to exhibit self…
Expand
Highly Cited
1995
Highly Cited
1995
OODB indexing by class-division
S. Ramaswamy
,
P. Kanellakis
ACM SIGMOD Conference
1995
Corpus ID: 7120514
Indexing a class hierarchy, in order to efficiently search or update the objects of a class according to a (range of) value(s) of…
Expand
Highly Cited
1994
Highly Cited
1994
Precoloring Extension with Fixed Color Bound
J. K. Il
1994
Corpus ID: 15999124
Precoloring Extension (shortly PrExt) is the following problem: Given a graph G with some precolored vertices and a color bound k…
Expand
Highly Cited
1983
Highly Cited
1983
A Description and Reasoning of Plant Controllers in Temporal Logic
Akira Fusaoka
,
H. Seki
,
Kazuko Takahashi
International Joint Conference on Artificial…
1983
Corpus ID: 14890098
This paper describes the methodology to deal with the behavior of a dynamical system such as plant controllers in the framework…
Expand
Highly Cited
1980
Highly Cited
1980
Variable Elimination and Chaining in a Resolution-based Prover for Inequalities
W. Bledsoe
,
Larry M. Hines
CADE
1980
Corpus ID: 43576661
A modified resolution procedure is described which has been designed to prove theorems about general linear inequalities. This…
Expand
1955
1955
On a class of decision procedures for ranking means
K. C. Seal
1955
Corpus ID: 63070973
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE