UP (Q906584)
complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input
Language:
other details
aliases unambiguous non-deterministic polynomial-time
description complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input

External Links
(P646) /m/01tbb9
(P6366) 93126310