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
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).