A note on time-space tradeoffs for computing continuous functions

Authors:
Harold Abelson
Affiliations:
Laboratory for Computer Science, MIT, Cambridge, MA, U.S.A.
Venue:
Information Processing Letters
Year:
1979

Citing 2
Cited 2

Time-space tradeoffs for computing functions, using connectivity properties of their circuits

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Graph-theoretic properties in computational complexity

Journal of Computer and System Sciences

Recursive construction for 3-regular expanders

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Highly Symmetric Expanders

Finite Fields and Their Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract