@prefix p: <http://www.wikidata.org/prop/> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix schema1: <http://schema.org/> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix wd: <http://www.wikidata.org/entity/> .
@prefix wds: <http://www.wikidata.org/entity/statement/> .
@prefix wdt: <http://www.wikidata.org/prop/direct/> .
@prefix wdtn: <http://www.wikidata.org/prop/direct-normalized/> .
@prefix wikibase: <http://wikiba.se/ontology#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

wd:Q906584 rdfs:label "يو بي"@ar,
        "UP"@ca,
        "UP"@en,
        "UP"@es,
        "UP"@fr,
        "egyértelmű polinomiális"@hu,
        "UP"@it,
        "UP"@ja,
        "UP"@ko,
        "UP"@mul,
        "UP"@pt,
        "UP"@zh,
        "UP"@zh-hans,
        "UP"@zh-hant,
        "UP"@zh-hk ;
    schema1:dateModified "2026-04-25T01:26:12+00:00"^^xsd:dateTime ;
    schema1:description "classe de complexitat"@ca,
        "complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input"@en,
        "komplikeca klaso"@eo,
        "clase de complejidad"@es,
        "classe de complexité"@fr,
        "bonyolultsági osztály"@hu,
        "classe di complessità"@it ;
    schema1:version 2484483938 ;
    wikibase:identifiers 2 ;
    wikibase:sitelinks 9 ;
    wikibase:statements 5 ;
    skos:altLabel "UP"@ar,
        "UP complexity class"@en,
        "unambiguous non-deterministic polynomial-time"@en,
        "UP"@hu ;
    p:P31 wds:Q906584-1E9863A9-BB3B-4EE3-B124-BCCCF8FA2266 ;
    p:P361 wds:Q906584-ECDAACF3-959F-4954-80FE-7BB455547ED7 ;
    p:P527 wds:Q906584-75cae079-48af-99f2-5841-9defcebc6d8a ;
    p:P6366 wds:Q906584-76A0CF78-F8F6-4414-9C7D-07AB6A379AAF ;
    p:P646 wds:Q906584-B296F12B-3A44-451C-BB8B-6F2959508146 ;
    wdtn:P6366 <https://makg.org/entity/93126310> ;
    wdt:P31 wd:Q908207 ;
    wdt:P361 wd:Q628036 ;
    wdt:P527 wd:Q846354 ;
    wdt:P6366 "93126310" ;
    wdt:P646 "/m/01tbb9" .