Skip to search formSkip to main contentSkip to account menu

UP (complexity)

Known as: Up 
In complexity theory, UP ("Unambiguous Non-deterministic Polynomial-time") is the complexity class of decision problems solvable in polynomial time… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
Book embeddingComplement (complexity)Complete (complexity)Complexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Finding strongly popular matchings in certain bipartite preference systems
The computational complexity of the popular matching problem in bipartite preference systems with ties depends greatly on the… 
2013
2013
The benefit of law-making power
We study optimal equilibria in multi-player games. An equilibrium is optimal for a player, if her payoff is maximal. A tempting… 
2012
2012
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable… 
2010
2010
User-oriented business processes
This paper points out a number of limitations in the way current notations and languages handle the relations between processes… 
2008
2008
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
2007
2007
Obtaining Use Cases and Security Use Cases from Secure Business Process through the MDA Approach
The invention relates to novel [(5,6,9a-substituted-3-oxo-1,2,9,9a-tetrahydro-3H-fluoren-7-yl)-oxy]al kanoic and cycloalkanoic… 
1998
1998
ON LOGARITHMICALLY SMALL ERRORSIN THE LATTICE POINT PROBLEMM
In the present paper we give an improvement of a previous result of the paper Skr, Theorem 2.2] on logarithmically small errors… 
1992
1992
On Polynomial Time One-Truth-Table Reducibility to a Sparse Set
  • O. Watanabe
  • Journal of computer and system sciences (Print)
  • 1992
  • Corpus ID: 896764
1991
1991
On polynomial-time truth-table reducibility of intractable sets to P-selective sets
The existence of setsnot being ≤ttP-reducible to low sets is investigated for several complexity classes such as UP, NP, the… 
1988
1988
On ≤1-ttp-Sparseness and Nondeterministic Complexity Classes (Extended Abstract)
For any reduction r, a set is called “≤ r p -sparse” if it is ≤ r p -reducible to a sparse set. The difficulty of sets in… 
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)