On complexity properties of recursively enumerable sets (Q4101804): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5573961 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Effective Procedures for Speeding Up Algorithms / rank | |||
Normal rank | |||
Latest revision as of 19:25, 12 June 2024
scientific article; zbMATH DE number 3523528
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity properties of recursively enumerable sets |
scientific article; zbMATH DE number 3523528 |
Statements
On complexity properties of recursively enumerable sets (English)
0 references
1974
0 references
