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

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.
2017
2017
Finding strongly popular b-matchings in bipartite graphs
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… 
2008
2008
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
  • K. Ko, Fuxiang Yu
  • Electron. Notes Theor. Comput. Sci.
  • 2008
  • Corpus ID: 207721843
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… 
Highly Cited
2003
Highly Cited
2003
Optimal proof systems imply complete sets for promise classes
Highly Cited
1992
Highly Cited
1992
Turing Machines with Few Accepting Computations and Low Sets for PP
1992
1992
On Polynomial Time One-Truth-Table Reducibility to a Sparse Set
Highly Cited
1987
Highly Cited
1987
On Helping by Robust Oracle Machines
  • K. Ko
  • Theor. Comput. Sci.
  • 1987
  • Corpus ID: 10913871
1983
1983
Transfer and ramified coverings
  • Larry Smith
  • Mathematical Proceedings of the Cambridge…
  • 1983
  • Corpus ID: 59378742
Abstract In this note we introduce a general class of finite ramified coverings π X˜ ↓ X. Examples of ramified covers in our… 
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