FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2016
01219892016

Related topics

Related topics

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

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
UP (complexity)
Computational complexity theory
Decision problem
P (complexity)
Integer factorization
Complexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
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… (More)
  • figure 1
Is this relevant?
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… (More)
  • figure 1
  • table I
  • table II
  • figure 3
  • figure 2
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Complexity Classes of Equivalence Problems Revisited
To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a… (More)
Is this relevant?
2010
2010
User-oriented business processes
  • Giorgio Bruno
  • 2010 Fourth International Conference on Research…
  • 2010
This paper points out a number of limitations in the way current notations and languages handle the relations between processes… (More)
  • 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… (More)
  • figure 1
  • figure 2
Is this relevant?
1998
1998
On Logarithmically Small Errorsin the Lattice Point Problemm
  • M. Skriganova, A. N. Starkovba Steklov
  • 1998
In the present paper we give an improvement of a previous result of the paper Skr, Theorem 2.2] on logarithmically small errors… (More)
Is this relevant?
1997
1997
Optimal Proof Systems for Propositional Logic and Complete Sets
A polynomial time computable function h : ! whose range is the set of tau-tologies in Propositional Logic (TAUT), is called a… (More)
Is this relevant?
1994
1994
Unambiguous Polynomial Hierarchies and Exponential Size
The classes NCk and A C k are defined by computational devices of polynomial size, i.e., by devices using a polynomially bounded… (More)
  • figure 2
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Turing Machines with few Accepting Computations and low Sets for PP
The intractability of the complexity class NP has motivated the study of subclasses that arise when certain restrictions on the… (More)
Is this relevant?