Comparison Between the Complexity of a Function and the Complexity of Its Graph

Authors:
Bruno Durand;Sylvain Porrot
Affiliations:
-;-
Venue:
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Year:
1998

Citing 0
Cited 3

Comparison between the complexity of a function and the complexity of its graph

Theoretical Computer Science
Optimal series-parallel trade-offs for reducing a function to its own graph

Information and Computation
Descriptive complexity of computable sequences

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract