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
2006
Highly Cited
2006
Control Reconfiguration After Actuator Failures Using Disturbance Decoupling Methods
This paper addresses the control of a system after an actuator has failed: A reconfiguration of the control structure is sought… 
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
2001
Highly Cited
2001
JavaAHP: a web-based decision analysis tool for natural resource and environmental management
Highly Cited
1999
Highly Cited
1999
New classes of efficiently solvable generalized Traveling Salesman Problems
We consider the n‐city traveling salesman problem (TSP), symmetric or asymmetric,with the following attributes. In one case, a… 
Highly Cited
1994
Highly Cited
1994
CONCUR ’94: Concurrency Theory
We develop decision procedures based on proof tableaux for a number of non-interleaving equivalences over processes. The… 
Highly Cited
1984
Highly Cited
1984
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
Current Temporal Logics are all oriented towards the description of totally ordered sequences. This limits their usefulness for… 
Highly Cited
1982
Highly Cited
1982
Soliton excitations in polyacetylene and relativistic field theory models
Highly Cited
1951
Highly Cited
1951
ON THE LATTICE OF SUBGROUPS OF FINITE GROUPS
Let G be a group. We shall denote by L(G) the lattice formed by all subgroups of G. Two groups G and H are said to be lattice… 
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)