A note on dense and nondense families of complexity classes (Q5619822): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 03:13, 12 June 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
