Adaptive logspace reducibility and parallel time
- 1 March 1995
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 28 (2) , 117-140
- https://doi.org/10.1007/bf01191473
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A very hard log-space counting classTheoretical Computer Science, 1993
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- Structural Complexity IIPublished by Springer Nature ,1990
- Two Applications of Inductive Counting for Complementation ProblemsSIAM Journal on Computing, 1989
- Structural Complexity IPublished by Springer Nature ,1988
- On truth-table reducibility to SAT and the difference hierarchy over NPPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- The Boolean formula value problem is in ALOGTIMEPublished by Association for Computing Machinery (ACM) ,1987
- The strong exponential hierarchy collapsesPublished by Association for Computing Machinery (ACM) ,1987
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977