A note on time-space tradeoffs for computing continuous functions
作者： Harold Abelson
DOI: 10.1016/0020-0190(79)90027-9
关键词: Computational complexity theory 、 Time space 、 Theoretical computer science 、 Mathematics
摘要:
elsevier.com
sci-hub.se 参考文章(2)
Leslie G. Valiant, Graph-theoretic properties in computational complexity Journal of Computer and System Sciences. ,vol. 13, pp. 278- 285 ,(1976) , 10.1016/S0022-0000(76)80041-4
Martin Tompa, Time-space tradeoffs for computing functions, using connectivity properties of their circuits symposium on the theory of computing. pp. 196- 204 ,(1978) , 10.1145/800133.804348