A note on structure and looking back applied to the relative complexity of computable functions (Q1158964): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (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.1016/0022-0000(81)90021-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2032079969 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Structure of Polynomial Time Reducibility / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the structure of sets in NP and other complexity classes / rank | |||
Normal rank | |||
Latest revision as of 13:28, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on structure and looking back applied to the relative complexity of computable functions |
scientific article |
Statements
A note on structure and looking back applied to the relative complexity of computable functions (English)
0 references
1981
0 references
subrecursive reducibilities
0 references
subrecursive degrees
0 references
complexity classes
0 references
enumeration properties of classes of computable functions
0 references
