P

    flowchart
    AA["Associated Authors (0)"]
    C[P]
    BC["Broader Concepts (1)"]
    NC["Narrower Concepts (0)"]
    C== skos:broader ==>BC
    NC== skos:broader ==>C
    AA== dcterms:relation ==>C
    click BC "#broader-concepts"
    click NC "#narrower-concepts"
    click AA "#associated-authors"

    NI["add incoming edge"]
    NO["add outgoing edge"]
    NI-- ? -->C
    C-- ? -->NO
    click NI "#add-incoming-edge"
    click NO "#add-outgoing-edge"
    style NI stroke-width:2px,stroke-dasharray: 5 5
    style NO stroke-width:2px,stroke-dasharray: 5 5

Graph neighborhood for 'P'. Click aggregate nodes to navigate.

Wikidata: https://www.wikidata.org/wiki/Q846354
OpenAlex ID: https://openalex.org/C134026603 (API record)
OpenAlex Description: computational complexity class of problems solvable by a deterministic Turing Machine in polynomial time
OpenAlex Level [?]: 3

P

Broader Concepts

Narrower Concepts

Associated Authors

Add Incoming Edge

Add Outgoing Edge