# UP

> complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input

**Wikidata**: [Q906584](https://www.wikidata.org/wiki/Q906584)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/UP_(complexity))  
**Source**: https://4ort.xyz/entity/up-q906584


## References

1. Freebase Data Dumps. 2013