On the computational structure of the connected components of a hard problem (Q1607000): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:01, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational structure of the connected components of a hard problem |
scientific article |
Statements
On the computational structure of the connected components of a hard problem (English)
0 references
25 July 2002
0 references
sparse sets
0 references
Turing complexity theory
0 references
