1. H. Abelson et al., “Compositional Complexity of Boolean Functions,” Discrete Appl. Math., 4, pp. 1–10 (1982).
2. Y. Abu-Mostafa, Complexity of Information Extraction, Ph.D. Thesis, Caltech, 1983.
3. Y. Abu-Mostafa, “Complexity of Random Problems,” invited paper, IEEE International Symposium on Information Theory, 1985.
4. G. Chaitin, “A Theory of Program Size Formally Identical to Information Theory,” J. Assoc. Comput. Mach., 22, pp. 329–340 (1975).
5. R. Duda and P. Hart, Pattern Classification and Scene Analysis, Wiley-Interscience, New York, 1973.