UP (Q906584)
Jump to navigation
Jump to search
complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input
- unambiguous non-deterministic polynomial-time
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | UP |
complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input |
|
Statements
Identifiers
Sitelinks
Wikipedia(9 entries)
- arwiki يو بي (تعقيد حسابي)
- cawiki UP (Complexitat)
- enwiki UP (complexity)
- eswiki UP (clase de complejidad)
- frwiki UP (complexité)
- jawiki UP (計算複雑性理論)
- kowiki UP (복잡도)
- ptwiki UP (complexidade)
- zhwiki UP (複雜度)