@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:Q215206 rdfs:label "مسألة كثيرة حدود غير قطعية كاملة"@ar,
        "NP-tam məsələ"@az,
        "NP-поўная"@be-tarask,
        "NP-complet"@ca,
        "NP-úplný"@cs,
        "NP-komplet"@da,
        "NP-Vollständigkeit"@de,
        "NP-completeness"@el,
        "NP-complete"@en,
        "NP-kompleta problemo"@eo,
        "NP-completo"@es,
        "انپی کامل"@fa,
        "NP-täydellinen"@fi,
        "problème NP-complet"@fr,
        "NP-שלמה"@he,
        "NP-teljes"@hu,
        "NP-completo"@it,
        "NP完全"@ja,
        "NP-완전"@ko,
        "НП-целосен проблем"@mk,
        "NP-komplett"@nb,
        "NP-volledig"@nl,
        "NP-komplett"@nn,
        "problem NP-zupełny"@pl,
        "NP-completo"@pt,
        "NP-completitudine"@ro,
        "NP-полная задача"@ru,
        "NP-kompletni problemi"@sh,
        "NP-úplný problém"@sk,
        "NP-popolnost"@sl,
        "НП-комплетни проблеми"@sr,
        "НП-комплетни проблеми"@sr-ec,
        "NP-kompletni problemi"@sr-el,
        "NP-fullständig"@sv,
        "เอ็นพีบริบูรณ์"@th,
        "NP-tam"@tr,
        "NP-повна задача"@uk,
        "NP-đầy đủ"@vi,
        "完全不確定性多項式時間類問題"@zh,
        "完全不确定性多项式时间类问题"@zh-cn,
        "NP完全"@zh-hans,
        "NP完全"@zh-hant,
        "NP完全"@zh-hk,
        "NP完全"@zh-sg,
        "完全不確定性多項式時間類問題"@zh-tw ;
    schema1:dateModified "2026-07-10T12:02:53+00:00"^^xsd:dateTime ;
    schema1:description "кляса складанасьці задачаў"@be-tarask,
        "třída složitosti"@cs,
        "Begriff aus der Informatik"@de,
        "complexity class"@en,
        "clase de complejidad"@es,
        "کلاس پیچیدگی محاسباتی"@fa,
        "vaativuusluokka"@fi,
        "classe de complexité"@fr,
        "bonyolultsági osztály"@hu,
        "classe di complessità"@it,
        "複雑性クラス"@ja,
        "clasă de complexitate"@ro,
        "тип задач в теории алгоритмов"@ru,
        "複雜度類別"@zh,
        "NP完全问题"@zh-hans,
        "複雜度類別"@zh-tw ;
    schema1:version 2515853598 ;
    wikibase:identifiers 12 ;
    wikibase:sitelinks 32 ;
    wikibase:statements 27 ;
    skos:altLabel "NP-поўнасьць"@be-tarask,
        "NP-completesa"@ca,
        "NP úplnost"@cs,
        "NP-úplná úloha"@cs,
        "NP-úplný problém"@cs,
        "NP-vollständig"@de,
        "CNP"@en,
        "NPC"@en,
        "nondeterministic polynomial time-complete"@en,
        "nondeterministic polynomial time-complete class"@en,
        "NP completitud"@es,
        "NP completo"@es,
        "NP-completitud"@es,
        "Problema NP completo"@es,
        "Problema NP-completo"@es,
        "Problemas NP completos"@es,
        "Problemas NP-completos"@es,
        "ان پی کامل"@fa,
        "NP-complet"@fr,
        "NP-completezza"@it,
        "NP-complete"@ko,
        "NP-compleet"@nl,
        "Klasa NPC"@pl,
        "NP-zupełność"@pl,
        "Problem NP zupełny"@pl,
        "NP Completo"@pt,
        "NP-полнота"@ru,
        "NP-трудная задача"@ru,
        "NPC"@ru,
        "Класс NP-complete"@ru,
        "Класа НП комплетних проблема"@sr,
        "Класа НП-комплетних проблема"@sr,
        "НП комплетан проблем"@sr,
        "НП комплетни проблеми"@sr,
        "НП-комплетан"@sr,
        "НП-комплетан проблем"@sr,
        "НП-комплетност"@sr,
        "NP-complete"@th,
        "ปัญหาเอ็นพีบริบูรณ์"@th,
        "NP-完全"@zh,
        "NPC问题"@zh,
        "NP完備"@zh,
        "NP完全"@zh,
        "NP完全問題"@zh,
        "NP完全问题"@zh,
        "完全不确定性多项式时间类问题"@zh,
        "NPC問題"@zh-tw,
        "NP完全"@zh-tw ;
    p:P10037 wds:Q215206-7EF23746-61CF-42FB-9F00-2D16FEBA2F70 ;
    p:P10283 wds:Q215206-DA82D75B-5341-4CEF-84BB-D8B27D38D10A ;
    p:P10565 wds:Q215206-B4394AE4-90A3-471A-AEBF-9A76E23D3DBE ;
    p:P1269 wds:Q215206-37aacf4f-4ff3-41be-f95f-11bc5b04e233 ;
    p:P14541 wds:Q215206-0DF58D79-40A3-4562-8BDF-8AE217C40CD7 ;
    p:P1482 wds:Q215206-233ce85b-4f6c-576c-5ecc-513ccf9b2594,
        wds:Q215206-98f40d2e-4051-35d8-4d19-de6a172a9773,
        wds:Q215206-dbf29a9c-48fc-b5cb-013e-6f62c0ab7d63 ;
    p:P1552 wds:Q215206-b481999a-44cd-d89f-7f58-5ae2903bca17 ;
    p:P18 wds:Q215206-8f1a4ef0-44ef-00ba-400f-d5a9140e2820 ;
    p:P279 wds:Q215206-c7a15d75-493f-9f75-bf09-b5ea5a58f542 ;
    p:P2812 wds:Q215206-23C60E5C-FDA3-48E1-A914-7111CA40EF6B ;
    p:P31 wds:Q215206-cc7fbe71-40dd-45fe-ca85-f0295d8d1cda ;
    p:P361 wds:Q215206-495f1792-435b-1773-793e-1c311c41a758,
        wds:Q215206-c4b26ba9-4e4d-a95a-a95c-d713d8767e8f ;
    p:P373 wds:Q215206-cf35c3bf-4c27-e13c-344e-f817f69b5cb4 ;
    p:P3847 wds:Q215206-b2629d0f-4ff8-bc0a-3b98-d1fe90e62a8e ;
    p:P5106 wds:Q215206-4963EB3D-3C8E-4C43-B7B8-5AAF48DF7397 ;
    p:P527 wds:Q215206-670e6b85-415d-ea43-3904-44ae051cde8f,
        wds:Q215206-b811305d-4c15-12f4-fcce-0e0705324f80 ;
    p:P6104 wds:Q215206-ED6797EF-1FB2-4DAA-B976-39E73832DBE6 ;
    p:P6366 wds:Q215206-A6C2699C-8C9B-49E5-A9DD-DC5DB70C920A ;
    p:P646 wds:Q215206-7FE8203F-FA2D-48EF-9CB6-D33D68BA7C47 ;
    p:P6781 wds:Q215206-de6e475e-41b4-9b48-aa7a-9db67db1216c ;
    p:P7726 wds:Q215206-85135bd7-4bd0-7da7-d8b4-a33547f35436 ;
    p:P910 wds:Q215206-33271758-81DA-4643-8AB3-602371D2DA36 ;
    p:P9100 wds:Q215206-9093f240-4e29-116e-1490-ae73bad87268 ;
    wdtn:P6366 <https://makg.org/entity/122749075> ;
    wdt:P10037 "problemi-np-completi" ;
    wdt:P10283 "C122749075" ;
    wdt:P10565 "207239" ;
    wdt:P1269 wd:Q746242 ;
    wdt:P14541 "2minu4" ;
    wdt:P1482 <https://cs.stackexchange.com/tags/np-complete>,
        <https://cstheory.stackexchange.com/tags/np-complete>,
        <https://stackoverflow.com/tags/np-complete> ;
    wdt:P1552 wd:Q65088257 ;
    wdt:P18 <http://commons.wikimedia.org/wiki/Special:FilePath/P%20np%20np-complete%20np-hard.svg> ;
    wdt:P279 wd:Q3435924 ;
    wdt:P2812 "NP-CompleteProblem" ;
    wdt:P31 wd:Q908207 ;
    wdt:P361 wd:Q1137554,
        wd:Q628036 ;
    wdt:P373 "NP-complete problems" ;
    wdt:P3847 "np-complete_problems" ;
    wdt:P5106 "npcomplete" ;
    wdt:P527 wd:Q7624684,
        wd:Q7977975 ;
    wdt:P6104 wd:Q8487137 ;
    wdt:P6366 "122749075" ;
    wdt:P646 "/m/09tkl" ;
    wdt:P6781 "Definition:NP-Complete" ;
    wdt:P7726 "NPcomplete" ;
    wdt:P910 wd:Q7481159 ;
    wdt:P9100 "np-completeness" .