Problems complete for deterministic logarithmic space
Authors:
- 1 September 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (3) , 385-394
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975