toIPA
Home
Blog
Category
Up
complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input
Pronunciation
/əp/
/ʌp/
Categories
complexity class