Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The low-impedance impulse voltage calibrator of high accuracy and stability can be used as a primary reference of impulse voltage… Expand
  • figure 1
  • table I
  • table II
  • figure 3
  • figure 2
Is this relevant?
2010
2010
  • Giorgio Bruno
  • Fourth International Conference on Research…
  • 2010
  • Corpus ID: 6491757
This paper points out a number of limitations in the way current notations and languages handle the relations between processes… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2008
2008
We investigate the computational complexity of computing the convex hull of a two-dimensional set. We study this problem in the… Expand
  • figure 1
  • figure 2
Is this relevant?
2007
2007
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… Expand
  • table 2
  • figure 1
  • table 3
  • figure 2
  • table 6
Is this relevant?
2004
2004
UP is the class of languages accepted by polynomial-time nondeterministic Turing machines that have at most one accepting path… Expand
Is this relevant?
2003
2003
We propose a two component graphical chain model, the discrete regression distribution, in which a set of categorical (or… Expand
  • figure 1
Is this relevant?
1998
1998
  • M. Skriganova, N. A., Starkovba
  • 1998
  • Corpus ID: 1878801
In the present paper we give an improvement of a previous result of the paper Skr, Theorem 2.2] on logarithmically small errors… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a… Expand
  • figure 1
Is this relevant?
1983
1983
In this note we introduce a general class of finite ramified coverings n.X^X. Examples of ramified covers in our sense include… Expand
Is this relevant?
1979
1979
We measured the thermal expansion of a polycrystalline lump of uranium monophosphide, using a sensitive capacitance dilatometer… Expand
  • figure 1
Is this relevant?