@article{818bc5edabc84b99b5cb6b69db72beba,
title = "Combining dimensionality and rate of growth arguments for establishing lower bounds on the number of multiplications",
author = "Kedem, {Zvi M.}",
note = "Funding Information: The problem of establishing lower bounds was tackled first using dimensionality arguments. Namely, describing the method informally, it was proved that algorithms computing certain sets of rational functions tThis research was supported by the National Science Foundation under research grant GJ34671.; 6th Annual ACM Symposium on Theory of Computing, STOC 1974 ; Conference date: 30-04-1974 Through 02-05-1974",
year = "1974",
month = jan,
day = "1",
doi = "10.1145/800119.803912",
language = "English (US)",
pages = "334--341",
journal = "Proceedings of the Annual ACM Symposium on Theory of Computing",
issn = "0737-8017",
publisher = "Association for Computing Machinery (ACM)",
}