A time-space hierarchy between polynomial time and polynomial space
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 25 (2) , 77-92
- https://doi.org/10.1007/bf02835830
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NCPublished by Springer Nature ,1990
- Relativized alternation and space-bounded computationJournal of Computer and System Sciences, 1988
- research-articleThe Journal of Symbolic Logic, 1986
- Diagonalisation methods in a polynomial settingPublished by Springer Nature ,1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Borel sets and circuit complexityPublished by Association for Computing Machinery (ACM) ,1983
- Relativizing Time, Space, and Time-SpaceSIAM Journal on Computing, 1982
- On simultaneous resource boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- On restricted turing computabilityTheory of Computing Systems, 1971