computational complexity (P1598)
From MaRDI portal
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 |
|
Data type
Item
