Asymptotical behaviour of some non-uniform measures
暂无分享,去创建一个
[1] Srecko Brlek,et al. On the Length of Word Chains , 1987, Inf. Process. Lett..
[2] Larry J. Stockmeyer,et al. Classifying the computational complexity of problems , 1987, The Journal of Symbolic Logic.
[3] Joaquim Gabarró. Initial Index: A New Complexity Function for Languages , 1983, ICALP.
[4] Jeffrey D. Ullman,et al. The compilation of regular expressions into integrated circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[5] Andrzej Ehrenfeucht,et al. Complexity measures for regular expressions , 1974, STOC '74.
[6] L. Hodes. Review: O. B. Lupanov, G. R. Kiss, Complexity of Formula Realization of Functions of Logical Algebra , 1971 .
[7] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.
[8] Claude E. Shannon,et al. The Number of Two‐Terminal Series‐Parallel Networks , 1942 .