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)

Related topics

Related topics

50 relations
AWPP (complexity)Advice (complexity)Approximation-preserving reductionArthur–Merlin protocol

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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
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
Fountain codes over fading relay channels
This paper discusses cooperative protocols based on fountain codes in a relay network. Unlike traditional fixed-rate codes… 
Highly Cited
2007
Highly Cited
2007
Movement-Aware Vertical Handoff of WLAN and Mobile WiMAX for Seamless Ubiquitous Access
This paper addresses a movement-aware vertical (MAV) handover algorithm between WLAN and Mobile WiMAX for seamless ubiquitous… 
Highly Cited
2002
Highly Cited
2002
A NOVEL APPROACH FOR THE ANALYSIS OF HIGH-FREQUENCY VIBRATIONS
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
Utility-based power control in cellular wireless systems
Distributed power control algorithms for systems with hard SIR constraints may diverge when infeasibility arises. We present a… 
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… 
Highly Cited
1994
Highly Cited
1994
Precoloring Extension with Fixed Color Bound
Precoloring Extension (shortly PrExt) is the following problem: Given a graph G with some precolored vertices and a color bound k… 
Highly Cited
1983
Highly Cited
1983
A Description and Reasoning of Plant Controllers in Temporal Logic
This paper describes the methodology to deal with the behavior of a dynamical system such as plant controllers in the framework… 
Highly Cited
1980
Highly Cited
1980
Variable Elimination and Chaining in a Resolution-based Prover for Inequalities
A modified resolution procedure is described which has been designed to prove theorems about general linear inequalities. This… 
1955
1955
On a class of decision procedures for ranking means
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)