{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:51:28Z","timestamp":1648666288742},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":[[1985,12]]},"DOI":"10.1007\/bf01699467","type":"journal-article","created":{"date-parts":[[2005,5,15]],"date-time":"2005-05-15T03:15:04Z","timestamp":1116126904000},"page":"153-170","source":"Crossref","is-referenced-by-count":11,"title":["Gradually intractable problems and nondeterministic log-space lower bounds"],"prefix":"10.1007","volume":"18","author":[{"given":"Takumi","family":"Kasai","sequence":"first","affiliation":[]},{"given":"Shigeki","family":"Iwata","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01699467_CR1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/62.322433","volume":"31","author":"A. Adachi","year":"1984","unstructured":"A. Adachi, S. Iwata and T. Kasai, Combinatorial game problems require \u03a9 (n i ) time,J. Assoc. Comput. Mach., 31, 361\u2013376 (1984).","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01699467_CR2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0022-0000(73)80048-0","volume":"7","author":"O. H. Ibarra","year":"1973","unstructured":"O. H. Ibarra, On two-way multi head automata,J. Comput. System Sci., 7, 28\u201336 (1973).","journal-title":"J. Comput. System Sci."},{"key":"BF01699467_CR3","first-page":"161","volume":"44","author":"S. Iwata","year":"1984","unstructured":"S. Iwata and T. Kasai, Problem requiringk logn deterministic space,Congressus Numerantium, 44, 161\u2013174 (1984).","journal-title":"Congressus Numerantium"},{"key":"BF01699467_CR4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"N. Jones","year":"1975","unstructured":"N. Jones, Space-bounded reducibility among combinatorial problems,J. Comput. System Sci., 11, 68\u201385 (1975).","journal-title":"J. Comput. System Sci."},{"key":"BF01699467_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","volume":"10","author":"N. Jones","year":"1976","unstructured":"N. Jones, Y. E. Lien and W. T. Laaser, New problems complete for nondeterministic log space,Math. System Theory, 10, 1\u201317 (1976).","journal-title":"Math. System Theory"},{"key":"BF01699467_CR6","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1137\/0208046","volume":"8","author":"T. Kasai","year":"1979","unstructured":"T. Kasai, A. Adachi, and S. Iwata, Classes of pebble games and complete problems,SIAM J. Comput., 8, 574\u2013586 (1979).","journal-title":"SIAM J. Comput."},{"key":"BF01699467_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00263746","volume":"6","author":"B. Monien","year":"1976","unstructured":"B. Monien, Transformational methods and their application to complexity problems,Acta Informatica, 6, 95\u2013108 (1976).","journal-title":"Acta Informatica"},{"key":"BF01699467_CR8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356698.356702","volume":"9","author":"J. L. Peterson","year":"1977","unstructured":"J. L. Peterson, Petri Nets,Computing Surveys, 9, 223\u2013252 (1977).","journal-title":"Computing Surveys"},{"key":"BF01699467_CR9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0022-0000(77)80042-1","volume":"14","author":"J. I. Seiferas","year":"1977","unstructured":"J. I. Seiferas, Relating refined space complexy classes,J. of Comput. System Sci., 14, 100\u2013129 (1977).","journal-title":"J. of Comput. System Sci."},{"key":"BF01699467_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0022-0000(77)80041-X","volume":"14","author":"J. I. Seiferas","year":"1977","unstructured":"J. I. Seiferas, Techniques for separating space complexity classes,J. of Comput. System Sci., 14, 73\u201399 (1977).","journal-title":"J. of Comput. System Sci."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01699467.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01699467\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01699467","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T16:09:19Z","timestamp":1557245359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01699467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF01699467"],"URL":"https:\/\/doi.org\/10.1007\/bf01699467","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}