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
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