UP
complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input
| rdfs:label |
"UP"@en
|
|
skos:alt |
"UP complexity class"@en
"unambiguous non-deterministic polynomial-time"@en
|
| schema:description |
"complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input"@en
|
|
schema:date |
"2026-04-25T01:26:12+00:00"^^xsd:dateTime |
| schema:version | 2484483938 |
| wikibase:identifiers | 2 |
| wikibase:sitelinks | 9 |
| wikibase:statements | 5 |
| p:P31 | wd:statement/Q906584-1E9863A9-BB3B-4EE3-B124-BCCCF8FA2266 |
| p:P361 | wd:statement/Q906584-ECDAACF3-959F-4954-80FE-7BB455547ED7 |
| p:P527 | wd:statement/Q906584-75cae079-48af-99f2-5841-9defcebc6d8a |
| p:P6366 | wd:statement/Q906584-76A0CF78-F8F6-4414-9C7D-07AB6A379AAF |
| p:P646 | wd:statement/Q906584-B296F12B-3A44-451C-BB8B-6F2959508146 |
|
p:direct- |
<https:/ |
| wdt:P31 | complexity class |
| wdt:P361 | NP |
| wdt:P527 | P |
| wdt:P6366 | "93126310" |
| wdt:P646 | "/m/01tbb9" |
Download as: