@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:Q628036 rdfs:label "كثير حدود غير قطعي"@ar,
        "NP-сложност"@bg,
        "NP"@bs,
        "NP"@ca,
        "NP"@cs,
        "NP"@da,
        "NP"@de,
        "NP"@en,
        "NP"@eo,
        "NP"@es,
        "NP (Konplexutasun klasea)"@eu,
        "ان پی"@fa,
        "NP (vaativuusluokka)"@fi,
        "NP"@fr,
        "NP"@he,
        "अनिश्चित बहुपद"@hi,
        "NP"@it,
        "NP"@ja,
        "NP"@ko,
        "NP"@nb,
        "NP"@nl,
        "NP i kompleksitetsteori"@nn,
        "Problem NP"@pl,
        "NP"@pt,
        "NP"@ro,
        "класс NP"@ru,
        "NP"@sl,
        "НП"@sr,
        "НП"@sr-ec,
        "NP"@sr-el,
        "NP"@sv,
        "เอ็นพี"@th,
        "NP"@tr,
        "клас складності NP"@uk,
        "NP"@vi,
        "NP (運算複雜度)"@yue,
        "不確定性多項式時間類問題"@zh,
        "不确定性多项式时间类问题"@zh-cn,
        "NP"@zh-hans,
        "NP"@zh-hant,
        "NP"@zh-hk,
        "不確定性多項式時間類問題"@zh-tw ;
    schema1:dateModified "2026-07-10T13:20:18+00:00"^^xsd:dateTime ;
    schema1:description "třída složitosti"@cs,
        "Komplexitätsklasse"@de,
        "computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time"@en,
        "klaso da decidoproblemoj solveblaj per nedetermina Turing-maŝino en polinoma tempo"@eo,
        "clase de complejidad computacional"@es,
        "classe de complexité des problèmes algorithmiques ; problèmes pouvant être résolus en temps polynomial par une machine de Turing non-déterministe"@fr,
        "מחלקת סיבוכיות חשובה של בעיות אלגוריתמיות, שכוללת את הבעיות שבהינתן פתרון מוצע כלשהו לבעיה, קל (\"קל\" במובן של סיבוכיות זמן ריצה \"סביר\" של אלגוריתם)"@he,
        "टुएरिंग मशीन के द्वारा हल किया जाता है"@hi,
        "insieme dei problemi decisionali che, per trovare una soluzione su una macchina di Turing non deterministica, impiegano un tempo polinomiale"@it,
        "計算量のクラス"@ja,
        "complexiteitsklasse"@nl,
        "problem decyzyjny"@pl,
        "非確定性圖靈機在多項式時間內可解決的決策問題的計算複雜度類別"@zh ;
    schema1:version 2515875650 ;
    wikibase:identifiers 9 ;
    wikibase:sitelinks 32 ;
    wikibase:statements 22 ;
    skos:altLabel "ان بي"@ar,
        "Сложност NP"@bg,
        "NP problém"@cs,
        "NP-obtížná úloha"@cs,
        "NP-obtížný problém"@cs,
        "NP-problém"@cs,
        "nedeterministicky polynomiální"@cs,
        "nedeterministicky polynomiální problém"@cs,
        "Komplexitätsklasse NP"@de,
        "NP-Probleme"@de,
        "NP class"@en,
        "non-deterministic polynomial"@en,
        "nondeterministic polynomial"@en,
        "nondeterministic polynomial complexity class"@en,
        "nondeterministic polynomial time"@en,
        "clase NP"@es,
        "tiempo polinomial no deterministico"@es,
        "tiempo polinomial no determinístico"@es,
        "classe NP"@fr,
        "problème NP"@fr,
        "NP קשה"@he,
        "NP-Complete"@he,
        "NP-שלמות"@he,
        "NPC"@he,
        "בעיה NP-שלמה"@he,
        "בעיית הסכום החלקי"@he,
        "מחלקת הסיבוכיות NPC"@he,
        "מחלקת סיבוכיות NPC"@he,
        "Klasa NP"@pl,
        "NP"@pl,
        "NP-трудность"@ru,
        "Класа НП"@sr,
        "Класа НП проблема"@sr,
        "Класа комплексности НП"@sr,
        "Класа проблема НП"@sr,
        "Класа сложености НП"@sr,
        "Algoritmik zorluk derecesi"@tr,
        "NP-zor"@tr,
        "Np tam"@tr,
        "Np-tam"@tr,
        "NP"@uk,
        "NP問題"@zh,
        "NP问题"@zh,
        "不确定性多项式时间类问题"@zh,
        "不確定性多項式時間"@zh ;
    p:P10283 wds:Q628036-464856A5-E538-4115-94CD-9BBDECA3ED92 ;
    p:P10565 wds:Q628036-0254EC19-C62A-4F95-916D-6AF48756DBEB ;
    p:P14541 wds:Q628036-87CD01C1-08FC-4AD9-ACB1-2B375B54E33F ;
    p:P1482 wds:Q628036-04EF099F-445C-4A72-87E2-5F83B0F401FC,
        wds:Q628036-1c8869f3-43bc-7eaf-0671-3d1563510a5b,
        wds:Q628036-c6891b47-4511-a971-7a7f-14b607308c43 ;
    p:P2581 wds:Q628036-26EA8BAA-4483-46E0-9C98-7D573CBC3955 ;
    p:P2812 wds:Q628036-74BD2599-4984-43C7-A161-BC10D6BD6646 ;
    p:P31 wds:q628036-b24c4a52-42c0-2f29-2f25-e83a77c1d0a9 ;
    p:P361 wds:Q628036-38d3b2ac-4aaa-4672-a219-6bbc222e3f5c,
        wds:Q628036-d1487c66-45a6-4e2c-0cbd-5d8d5673cdf3 ;
    p:P460 wds:Q628036-5b93c643-4c49-a29c-ff2e-f84974f5ab81 ;
    p:P5106 wds:Q628036-319e53ea-4b54-61cd-c2b3-b187167a6530 ;
    p:P527 wds:Q628036-7c1d04a7-4f78-cdef-cbac-090d2f412d39,
        wds:Q628036-8c758e2b-48d7-4cf5-945b-8aab3da78309,
        wds:Q628036-a1fca1a7-402d-1f55-3a0c-abd125dda378,
        wds:Q628036-b5497c3e-4045-d35d-4e1a-c05ccd043080,
        wds:Q628036-e401c0b3-4245-279c-69fc-c8d90ab0304e ;
    p:P6104 wds:Q628036-232E64C9-D6F8-45C6-98D8-3C0D24CB60BA ;
    p:P6366 wds:Q628036-8C6B196A-AEF0-4C29-B8E7-7B3CFB610724 ;
    p:P646 wds:Q628036-11A11565-DA74-42FF-A580-625D1233CE08 ;
    p:P6781 wds:Q628036-93128f36-498b-dd0c-9a8e-1b5a6d26b2ba ;
    wdtn:P2581 <http://babelnet.org/rdf/s01440834n> ;
    wdtn:P6366 <https://makg.org/entity/91331118> ;
    wdt:P10283 "C91331118" ;
    wdt:P10565 "207012" ;
    wdt:P14541 "2Z7brH" ;
    wdt:P1482 <https://cs.stackexchange.com/tags/np>,
        <https://cstheory.stackexchange.com/tags/np>,
        <https://stackoverflow.com/tags/np> ;
    wdt:P2581 "01440834n" ;
    wdt:P2812 "NP-Problem" ;
    wdt:P31 wd:Q908207 ;
    wdt:P361 wd:Q110989475,
        wd:Q110989556 ;
    wdt:P460 wd:Q846354 ;
    wdt:P5106 "np" ;
    wdt:P527 wd:Q1130846,
        wd:Q115868692,
        wd:Q17134011,
        wd:Q215206,
        wd:Q906584 ;
    wdt:P6104 wd:Q8487137 ;
    wdt:P6366 "91331118" ;
    wdt:P646 "/m/05dsb" ;
    wdt:P6781 "Definition:NP_Complexity_Class" .