the most specific complexity class this computational problem has been proved to belong to; if available, provide the tight complexity, otherwise both hardness and membership can be specified English
edit
Language Label Description Also known as
British English
No label defined
No description defined

    Data type

    Item

    Statements

    0 references
    Q905789 (Deleted Item)
    0 references
    Q215206 (Deleted Item)
    0 references
    Q905967 (Deleted Item)
    0 references
    Q22988631 (Deleted Item)
    0 references
    Q47512165 (Deleted Item)
    0 references
    Q21503250 (Deleted Item)
    relation English
    Q30208840 (Deleted Item)
    0 references
    Q21510865 (Deleted Item)
    relation English
    Q21503252 (Deleted Item)
    Q908207 (Deleted Item)
    0 references
    Q54554025 (Deleted Item)
    0 references
    Q52004125 (Deleted Item)
    Q29934200 (Deleted Item)
    0 references
    Q53869507 (Deleted Item)
    Q54828448 (Deleted Item)
    0 references
    Q19474404 (Deleted Item)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references