{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:29:56Z","timestamp":1648628996567},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,10,1]],"date-time":"1978-10-01T00:00:00Z","timestamp":276048000000},"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":12708,"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":[[1978,10]]},"DOI":"10.1016\/0022-0000(78)90008-9","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"253-269","source":"Crossref","is-referenced-by-count":1,"title":["The complexity of total order structures"],"prefix":"10.1016","volume":"17","author":[{"given":"Dan","family":"Moore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Case","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(78)90008-9_BIB1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine independent theory of complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(78)90008-9_BIB2","doi-asserted-by":"crossref","first-page":"579","DOI":"10.2307\/2271984","article-title":"On complexity properties of recursively enumerable sets","volume":"38","author":"Blum","year":"1973","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(78)90008-9_BIB3","series-title":"Recursive Function Theory: Newsletter, No 2","first-page":"15","article-title":"Strong Operator Recursion Theorem and an Application to Automata","author":"Case","year":"1972"},{"key":"10.1016\/0022-0000(78)90008-9_BIB4","article-title":"Effectively Entending the Set of Acceptable Inputs of Programs","author":"Case","year":"1973"},{"key":"10.1016\/0022-0000(78)90008-9_BIB5","article-title":"Sortability and Extensibility of the Graphs of R.E. Partial and Total Orders","author":"Case","year":"1973"},{"key":"10.1016\/0022-0000(78)90008-9_BIB6","series-title":"Constructive Order Types","author":"Crossley","year":"1969"},{"key":"10.1016\/0022-0000(78)90008-9_BIB7","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1145\/321832.321840","article-title":"On almost everywhere complex recursive functions","volume":"21","author":"Gill","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(78)90008-9_BIB8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(78)90008-9_BIB9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2272545","article-title":"Computational speed-up by effective operators","volume":"37","author":"Meyer","year":"1972","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(78)90008-9_BIB10","first-page":"10","author":"Morris","year":"1972","journal-title":"Recursive Function Theory: Newsletter, No. 2"},{"key":"10.1016\/0022-0000(78)90008-9_BIB11","unstructured":"P. Morris, Private communication."},{"key":"10.1016\/0022-0000(78)90008-9_BIB12","article-title":"Degree of Difficulty of Computing a Function and a Partial Ordering of Recursive Sets","author":"Rabin","year":"1960"},{"key":"10.1016\/0022-0000(78)90008-9_BIB13","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(78)90008-9_BIB14","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1145\/321510.321525","article-title":"Toward a theory of enumerations","volume":"16","author":"Young","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(78)90008-9_BIB15_1","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01702871","article-title":"Speed-ups by changing the order in which sets are enumerated","volume":"5","author":"Young","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(78)90008-9_BIB15_2","first-page":"352","article-title":"Speed-ups by changing the order in which sets are enumerated","volume":"7","author":"Young","year":"1973","journal-title":"Corrigendum"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000078900089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:28:25Z","timestamp":1550323705000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000078900089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,10]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,10]]}},"alternative-id":["0022000078900089"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(78)90008-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1978,10]]}}}