{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:32:52Z","timestamp":1648722772870},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf02835830","type":"journal-article","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T02:28:20Z","timestamp":1202956100000},"page":"77-92","source":"Crossref","is-referenced-by-count":4,"title":["A time-space hierarchy between polynomial time and polynomial space"],"prefix":"10.1007","volume":"25","author":[{"given":"P.","family":"Clote","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02835830_CR1","unstructured":"M. Blum and R. Impagliazzo, Generic oracles and oracle classes,Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (1988), pp. 118\u2013126."},{"key":"BF02835830_CR2","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0211048","volume":"11","author":"R. V. Book","year":"1982","unstructured":"R. V. Book, C. B. Wilson, and Xu Mei-Rui, Relativizing time, space, and time-space,SIAM Journal on Computing,11 (1982), 571\u2013581.","journal-title":"SIAM Journal on Computing"},{"key":"BF02835830_CR3","series-title":"Studies in Proof Theory","volume-title":"Bounded Arithmetic","author":"S. R. Buss","year":"1986","unstructured":"S. R. Buss,Bounded Arithmetic, Studies in Proof Theory, vol. 3, Bibliopolis, Naples (1986). See also The polynomial hierarchy and bounded arithmetic,Proceedings of the 17th ACM Symposium on Theory of Computing pp. 285\u2013290."},{"issue":"3","key":"BF02835830_CR4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0022-0000(88)90034-7","volume":"36","author":"J. F. Buss","year":"1988","unstructured":"J. F. Buss, Relativized alternation and space-bounded computation,Journal of Computer and System Sciences,36(3) (1988), 351\u2013378.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02835830_CR5","first-page":"85","volume-title":"Contemporary Mathematics","author":"P. Clote","year":"1990","unstructured":"P. Clote, A smash-based hierarchy betweenPTIME andPSPACE (preliminary version), inContemporary Mathematics, vol. 106 ed. W. Sieg, Birkh\u00e4user, Boston (1990), pp. 85\u2013100."},{"key":"BF02835830_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-1-4612-3466-1_4","volume-title":"Feasible Mathematics","author":"P. Clote","year":"1990","unstructured":"P. Clote, Sequential, machine independent characterizations of the parallel complexity classesALOGTIME, AC *, andNC, inFeasible Mathematics, eds. S. Buss and P. Scott, Birkh\u00e4user, Boston (1990), pp. 49\u201370."},{"key":"BF02835830_CR7","unstructured":"P. Clote,ALOGTIME and a conjecture of S. A. Cook, inProceedings of Logic in Computer Science, Philadelphia, June 1990."},{"key":"BF02835830_CR8","first-page":"24","volume-title":"Logic, Methodology and Philosophy of Science II","author":"A. Cobham","year":"1965","unstructured":"A. Cobham, The intrinsic computational difficulty of functions, inLogic, Methodology and Philosophy of Science II, ed. Y. Bar-Hillel, North-Holland, Amsterdam (1965), pp. 24\u201330."},{"key":"BF02835830_CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook, A taxonomy of problems with fast parallel algorithms,Information and Control,64, (1985), 2\u201322.","journal-title":"Information and Control"},{"issue":"4","key":"BF02835830_CR10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01694077","volume":"5","author":"E. P. Glinert","year":"1971","unstructured":"E. P. Glinert, On restricted Turing computability,Mathematical Systems Theory,5(4) (1971), 331\u2013343.","journal-title":"Mathematical Systems Theory"},{"key":"BF02835830_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman,Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA (1979)."},{"key":"BF02835830_CR12","unstructured":"K. Ko, Relativized polynomial time hierarchies having exactlyk levels,Proceedings of the 20th Annual ACM Symposium on Theory of Computing (1988), pp. 245\u2013253."},{"key":"BF02835830_CR13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01683260","volume":"10","author":"R. Ladner","year":"1976","unstructured":"R. Ladner and N. Lynch, Relativizations of questions about log-space reducibility,Mathematical Systems Theory,10 (1976), 19\u201332.","journal-title":"Mathematical Systems Theory"},{"issue":"3","key":"BF02835830_CR14","first-page":"261","volume":"35","author":"J. Paris","year":"1987","unstructured":"J. Paris and A. Wilkie, On the scheme of induction for bounded arithmetic formulas,Annals of Pure and Applied Logic,35(3) (1987), 261\u2013302.","journal-title":"Annals of Pure and Applied Logic"},{"key":"BF02835830_CR15","doi-asserted-by":"crossref","unstructured":"N. Pippinger, On simultaneous resource bounds,Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science (1979), pp. 307\u2013311.","DOI":"10.1109\/SFCS.1979.29"},{"key":"BF02835830_CR16","doi-asserted-by":"crossref","unstructured":"B. Poizat,Q=NQ?,Journal of Symbolic Logic,51(1) (1986).","DOI":"10.2307\/2273938"},{"key":"BF02835830_CR17","series-title":"Oxford Logic Guides","volume-title":"Subrecursion\u2014Functions and Hierarchies","author":"H. E. Rose","year":"1984","unstructured":"H. E. Rose,Subrecursion\u2014Functions and Hierarchies, Oxford Logic Guides: 9, Clarendon Press, Oxford (1984), 189 pp."},{"key":"BF02835830_CR18","doi-asserted-by":"crossref","unstructured":"M. Sipser, Borel sets and circuit complexity,Proceedings of the 15th Annual ACM Symposium on Theory of Computing (1983), pp. 61\u201369.","DOI":"10.1145\/800061.808733"},{"key":"BF02835830_CR19","doi-asserted-by":"crossref","unstructured":"R. Smolensky, Algebraic methods in the theory of lower bounds for boolean circuit complexity,Proceedings of the 19th Annual ACM Symposium on Theory of Computing (1987), pp. 77\u201382.","DOI":"10.1145\/28395.28404"},{"key":"BF02835830_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01706069","volume":"6","author":"D. B. Thompson","year":"1972","unstructured":"D. B. Thompson, Subrecursiveness: machine-independent notions of computability in restricted time and storage,Mathematical Systems Theory,6 (1972), 3\u201315.","journal-title":"Mathematical Systems Theory"},{"key":"BF02835830_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/3-540-16486-3_109","volume-title":"Structure in Complexity Theory","author":"L. Torenvliet","year":"1986","unstructured":"L. Torenvliet and P. van Emde Boas, Diagonalization in a polynomial setting,Structure in Complexity Theory, Lecture Notes in Computer Science, vol. 223, ed. A. L. Selman, Springer-Verlag, Berlin (1986), pp. 330\u2013346."},{"key":"BF02835830_CR22","volume-title":"Computational Complexity","author":"K. Wagner","year":"1986","unstructured":"K. Wagner and G. Wechsung,Computational Complexity, Reidel, Dordrecht (1986), 551 pp."},{"key":"BF02835830_CR23","volume-title":"General Topology","author":"S. Willard","year":"1970","unstructured":"S. Willard,General Topology, Addison-Wesley, Reading, MA (1970), 369 pp."},{"key":"BF02835830_CR24","unstructured":"A. C. Tao, Separating the polynomial time hierarchy by oracles: Part I,Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science (1985), pp. 1\u201310."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02835830.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02835830\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02835830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T05:12:08Z","timestamp":1558242728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02835830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF02835830"],"URL":"https:\/\/doi.org\/10.1007\/bf02835830","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}