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

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Uncertainty Evaluation of the Waveform Parameters of 1-kV Low-Impedance Impulse Voltage Calibrator
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
User-oriented business processes
  • 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
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
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
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… Expand
  • table 2
  • figure 1
  • table 3
  • figure 2
  • table 6
Is this relevant?
2004
2004
A note on quadratic residuosity and UP
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
Random Effects Graphical Models for Multiple Site Sampling ∗ †
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
ON LOGARITHMICALLY SMALL ERRORSIN THE LATTICE POINT PROBLEMM
  • 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
New Collapse Consequences of NP Having Small Circuits
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
Transfer and ramified coverings
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
Volume changes at the magnetic transitions of UP
We measured the thermal expansion of a polycrystalline lump of uranium monophosphide, using a sensitive capacitance dilatometer… Expand
  • figure 1
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE