Comparison between the complexity of a function and the complexity of its graph (Q5958280)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1715281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9205032
0 references
0 references
0 references
0 references
0 references
