Comparison between the complexity of a function and the complexity of its graph (Q5958280): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(01)00029-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968180501 / rank | |||
Normal rank | |||
Latest revision as of 10:43, 30 July 2024
scientific article; zbMATH DE number 1715281
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison between the complexity of a function and the complexity of its graph |
scientific article; zbMATH DE number 1715281 |
Statements
Comparison between the complexity of a function and the complexity of its graph (English)
0 references
3 March 2002
0 references
Kolmogorov complexity
0 references
recursive infinite sequences
0 references
data flow complexity
0 references
recursive function
0 references
