Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,715,082 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
2014
Highly Cited
2014
Robust Stabilization of Discrete-Time Positive Switched Systems with Uncertainties and Average Dwell Time Switching
Junfeng Zhang
,
Zhengzhi Han
,
Hai Wu
,
Jun Huang
Circuits Syst. Signal Process.
2014
Corpus ID: 27657809
This paper studies robust problems of a class of discrete-time positive switched systems with uncertainties. The uncertainties…
Expand
Highly Cited
2010
Highly Cited
2010
Jena Research Papers in Business and Economics Optimally Routing and Scheduling Tow Trains for JIT-Supply of Mixed-Model Assembly Lines
N. Boysen
2010
Corpus ID: 14264961
In recent years, more and more automobile producers adopted the supermarketconcept to enable a exible and reliable Just-in-Time…
Expand
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
2002
Highly Cited
2002
A NOVEL APPROACH FOR THE ANALYSIS OF HIGH-FREQUENCY VIBRATIONS
G. Wei
,
Y. B. Zhao
,
Y. Xiang
2002
Corpus ID: 124005696
Abstract Despite much effort in the past few decades, the numerical prediction of high-frequency vibrations remains a challenging…
Expand
Highly Cited
2001
Highly Cited
2001
Utility-based power control in cellular wireless systems
Mingbo Xiao
,
N. Shroff
,
E. Chong
Proceedings IEEE INFOCOM . Conference on Computer…
2001
Corpus ID: 12262184
Distributed power control algorithms for systems with hard SIR constraints may diverge when infeasibility arises. We present a…
Expand
Highly Cited
2001
Highly Cited
2001
JavaAHP: a web-based decision analysis tool for natural resource and environmental management
Xuan Zhu
,
A. Dale
Environmental Modelling & Software
2001
Corpus ID: 34769702
Highly Cited
1984
Highly Cited
1984
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
S. Pinter
,
P. Wolper
ACM SIGACT-SIGOPS Symposium on Principles of…
1984
Corpus ID: 14785057
Current Temporal Logics are all oriented towards the description of totally ordered sequences. This limits their usefulness for…
Expand
Highly Cited
1982
Highly Cited
1982
Soliton excitations in polyacetylene and relativistic field theory models
D. Campbell
,
A. Bishop
1982
Corpus ID: 13005750
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
Highly Cited
1980
Highly Cited
1980
Recognizing Disguised NR(1) Instances of the Satisfiability Problem
Bengt Aspvall
J. Algorithms
1980
Corpus ID: 5296270
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