Which problems have strongly exponential complexity? (Q1604206): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q55891730, #quickstatements; #temporary_batch_1714639695901 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcss.2001.1774 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995725694 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q55891730 / rank | |||
Normal rank | |||
Latest revision as of 10:53, 2 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Which problems have strongly exponential complexity? |
scientific article |
Statements
Which problems have strongly exponential complexity? (English)
0 references
4 July 2002
0 references
sub-exponential reduction family
0 references
NP-complete problems
0 references
