Also known as unambiguous non-deterministic polynomial-time, UP complexity class
complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input
Connections
digital object identifier
Entity
International Standard Serial Number
Entity
Q118398
Entity
computational complexity theory
Entity
integer factorization
Entity
NP-complete
Entity
NP
Entity
decision problem
Entity
time complexity
Entity
P
Entity
Leslie Valiant
Entity
NP-hard
Entity
complexity class
Entity
non-deterministic Turing machine
Entity
PSPACE
Entity
NL
Entity
co-NP
Entity
EXPTIME
Entity
L
Entity
BPP
Entity