On Relating Time and Space to Size and Depth
- 1 December 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (4), 733-744
- https://doi.org/10.1137/0206054
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The complexity of monotone boolean functionsTheory of Computing Systems, 1977
- Log Space Recognition and Translation of Parenthesis LanguagesJournal of the ACM, 1977
- A characterization of the power of vector machinesJournal of Computer and System Sciences, 1976
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- On time versus space and related problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Fast parallel matrix inversion algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972
- Efficient determination of the transitive closure of a directed graphInformation Processing Letters, 1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970