Journal of the ACM Bibliography

Additional Key Words and Phrases: computational work, finite machines, automata, memory hierarchies, general purpose computer, computational efficiency, functional complexity

Selected papers that cite this one

• Bernd Borchert and Antoni Lozano. Succinct circuit representations and leaf language classes are basically the same concept. Information Processing Letters, 59(4):211-215, 26 August 1996.

• L. H. Harper, W. N. Hsieh, and J. E. Savage. A class of Boolean functions with linear combinational complexity. Theoretical Computer Science, 1(2):161-183, December 1975.

• Montserrat Hermo and Elvira Mayordomo. A note on polynomial-size circuits with low resource-bounded kolmogorov complexity. Mathematical Systems Theory, 27(4):347-356, July/August 1994.

• R. Kannan. Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control, 55(1-3):40-56, October/November/December 1982.

• R. E. Ladner, N. A. Lynch, and A. L. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2):103-123, December 1975.

Selected references

• Marvin Minsky. Form and content in computer science. Journal of the ACM, 17(2):197-215, April 1970.

• S. Winograd. On the time required to perform addition. Journal of the ACM, 12(2):277-285, April 1965.

• S. Winograd. On the time required to perform multiplication. Journal of the ACM, 14(4):793-802, October 1967.

• Daniel H. Younger. Recognition and parsing of context-free languages in time Information and Control, 10(2):189-208, February 1967.

Shortcuts: