Constant Depth Reducibility
- 1 May 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (2), 423-439
- https://doi.org/10.1137/0213028
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- On Some Deterministic Space Complexity ProblemsSIAM Journal on Computing, 1982
- Random walks, universal traversal sequences, and the complexity of maze problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Bounds to Complexities of Networks for Sorting and for SwitchingJournal of the ACM, 1975
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970