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.
2017
2017
Finding strongly popular b-matchings in bipartite graphs
Abstract The computational complexity of the bipartite popular matching problem depends on how indifference appears in the… Expand
  • figure 1
  • figure 2
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
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… Expand
  • figure 1
  • figure 2
  • figure 3
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2009
2009
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… Expand
  • figure 1
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
1991
1991
On the Limitations of Locally Robust Positive Reductions
Polynomial-time positive reductions, as introduced by Selman, are by definition globally robust — they are positive with respect… Expand
Highly Cited
1987
Highly Cited
1987
On Helping by Robust Oracle Machines
  • K. Ko
  • Theor. Comput. Sci.
  • 1987
    • Corpus ID: 10913871
Abstract The concept of helping by robust oracle Turing machines, introduced recently by Schoning, is extended to the notion of… Expand
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
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
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