This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baker, B., Gill, J., and Solovay, R., Relativizations of the P=?NP question, SIAM Journal of Computing 4 (1975) pp 431–442
Book, R. V., Greibach, S. A., and Wegbreit, B., Time and tape bounded Turing acceptors and AFL's, Journal of Computer and System Science 4 (1970) pp 606–621
Hopcroft, J. E., Paul, W. J., and Valiant, L. G., On time versus space, Journal ACM, 24 (1977) pp 332–337
Paul, W. J., Pippenger, N., Szemeredi, E., Trotter, W. T., On determinism and nondeterminism and related problems, FOCS (1983) pp 429–438
Paul, W. J. and Reischuk, R., On Alternation, II, Acta Informatica, 14 (1980) pp 391–403
Wrathall, C., Subrecursive Predicates and Automata, Harvard University Thesis, reprinted by Department of Mathematics, University of California, Santa Barbara
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tretkoff, C. (1986). Bounded oracles and complexity classes inside linear space. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16486-3_110
Download citation
DOI: https://doi.org/10.1007/3-540-16486-3_110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16486-9
Online ISBN: 978-3-540-39825-7
eBook Packages: Springer Book Archive