{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:09:39Z","timestamp":1753355379790},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,2,1]],"date-time":"1980-02-01T00:00:00Z","timestamp":318211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12220,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1980,2]]},"DOI":"10.1016\/0022-0000(80)90001-x","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"1-17","source":"Crossref","is-referenced-by-count":9,"title":["A characterization of time complexity by simple loop programs"],"prefix":"10.1016","volume":"20","author":[{"given":"Takumi","family":"Kasai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akeo","family":"Adachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(80)90001-X_BIB1","unstructured":"A. Adachi, A relation between space complexity and the largest number, in preparation."},{"key":"10.1016\/0022-0000(80)90001-X_BIB2","series-title":"Currents in the Theory of Computing","first-page":"35","article-title":"Computational complexity: Theory and practice","author":"Borodin","year":"1973"},{"key":"10.1016\/0022-0000(80)90001-X_BIB3","series-title":"Proceedings, 2nd Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"On the size of programs in subrecursive hierarchies","author":"Constable","year":"1970"},{"key":"10.1016\/0022-0000(80)90001-X_BIB4","series-title":"IEEE Conference Record, 11th Annual Symposium on Switching and Automata Theory","first-page":"60","article-title":"On the efficiency of programs in subrecursive formalisms","author":"Constable","year":"1970"},{"key":"10.1016\/0022-0000(80)90001-X_BIB5","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","article-title":"Time bounded random access machines","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0022-0000(80)90001-X_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-08921-7_70","article-title":"Loop Programs and Classes of Primitive Recursive Functions","author":"Goetze","year":"1978","journal-title":"Lecture Notes, Mathematical Foundations of Computer Science No. 78"},{"key":"10.1016\/0022-0000(80)90001-X_BIB7","series-title":"Rozprawy Mathematyczne, No. 4","first-page":"1","article-title":"Some Classes of Recursive Functions","author":"Grzegorczyk","year":"1953"},{"key":"10.1016\/0022-0000(80)90001-X_BIB8","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1145\/322003.322016","article-title":"Even simple programs are hard to analyze","volume":"24","author":"Jones","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(80)90001-X_BIB9","doi-asserted-by":"crossref","first-page":"469","DOI":"10.2977\/prims\/1195189815","article-title":"Computational complexity of multitape Turing machines and random access machines","volume":"13","author":"Kasai","year":"1977","journal-title":"Publ. RIMS, Kyoto Univ."},{"key":"10.1016\/0022-0000(80)90001-X_BIB10","series-title":"Proceedings, Second IBM Symposium on Mathematical Foundations of Computer Science","article-title":"P = NP question on program schemata","author":"Kasai","year":"1977"},{"key":"10.1016\/0022-0000(80)90001-X_BIB11","article-title":"A theoretical study on the time analysis of programs","author":"Kasai","year":"1979"},{"key":"10.1016\/0022-0000(80)90001-X_BIB12","series-title":"Proceedings, 22nd National ACM Conference","first-page":"465","article-title":"The complexity of loop programs","author":"Meyer","year":"1967"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008090001X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008090001X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:29:15Z","timestamp":1550305755000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200008090001X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,2]]}},"alternative-id":["002200008090001X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(80)90001-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1980,2]]}}}