Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
This paper studies robust problems of a class of discrete-time positive switched systems with uncertainties. The uncertainties… 
Highly Cited
2010
Highly Cited
2010
In recent years, more and more automobile producers adopted the supermarketconcept to enable a exible and reliable Just-in-Time… 
Highly Cited
2009
Highly Cited
2009
This paper discusses cooperative protocols based on fountain codes in a relay network. Unlike traditional fixed-rate codes… 
Highly Cited
2002
Highly Cited
2002
Abstract Despite much effort in the past few decades, the numerical prediction of high-frequency vibrations remains a challenging… 
Highly Cited
2001
Highly Cited
2001
Distributed power control algorithms for systems with hard SIR constraints may diverge when infeasibility arises. We present a… 
Highly Cited
1984
Highly Cited
1984
Current Temporal Logics are all oriented towards the description of totally ordered sequences. This limits their usefulness for… 
Highly Cited
1980
Highly Cited
1980
A modified resolution procedure is described which has been designed to prove theorems about general linear inequalities. This… 
Highly Cited
1980