A note on dense and nondense families of complexity classes (Q5619822): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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: Classes of computable functions defined by bounds on computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Real time computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Toward a Theory of Enumerations / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01691468 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054518661 / rank | |||
Normal rank | |||
Latest revision as of 10:51, 30 July 2024
scientific article; zbMATH DE number 3343698
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on dense and nondense families of complexity classes |
scientific article; zbMATH DE number 3343698 |
Statements
A note on dense and nondense families of complexity classes (English)
0 references
1971
0 references
