computational complexity (P10374)

From Mepdata
Jump to navigation Jump to search
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
  • complexity class
  • computational complexity class
Language Label Description Also known as
English
computational complexity
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
  • complexity class
  • computational complexity class

Data type

Item

Statements

Q1361537 (Deleted Item)
Q6954626 (Deleted Item)
0 references
Q1239194 (Deleted Item)
Q905789 (Deleted Item)
0 references
Q6042592 (Deleted Item)
Q215206 (Deleted Item)
0 references
Q1350285 (Deleted Item)
Q905967 (Deleted Item)
0 references
Q22988631 (Deleted Item)
0 references
Q47512165 (Deleted Item)
0 references
Q21503250 (Deleted Item)
Q30208840 (Deleted Item)
Q3435924 (Deleted Item)
0 references
Q21510865 (Deleted Item)
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
Q5157286 (Deleted Item)
0 references