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
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… 
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
Multi-Lateralisms : Explaining Variation in Regime Instruments The Harvard Project on International Climate Agreements
Different international regimes are built from legal instruments that vary in terms of whether they are multilateral or bilateral… 
2010
2010
Composition of Zero-Knowledge Proofs with Efficient Provers
We revisit the composability of different forms of zero- knowledge proofs when the honest prover strategy is restricted to be… 
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… 
2004
2004
A note on quadratic residuosity and UP
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
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… 
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)