Comparison between the complexity of a function and the complexity of its graph
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1222608
- Complexity of computation of some functions of graphs
- scientific article; zbMATH DE number 706829
- Computational complexity of graphs
- Graph complexity
- On Graph Complexity
- The linear complexity of a graph
- The linear complexity of a graph
- Graph complexity and slice functions
- scientific article; zbMATH DE number 3878983
Cites work
- A variant of the Kolmogorov concept of complexity
- Descriptive complexity of computable sequences
- scientific article; zbMATH DE number 736618 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- Relations between varieties of kolmogorov complexities
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
Cited in
(7)- A note on arbitrarily complex recursive functions
- Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
- scientific article; zbMATH DE number 3929065 (Why is no real title available?)
- scientific article; zbMATH DE number 1222608 (Why is no real title available?)
- Probability and program-size for functions
- Descriptive complexity of computable sequences
- Computation of recursive functionals using minimal initial segments
This page was built for publication: Comparison between the complexity of a function and the complexity of its graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958280)
