{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T22:05:41Z","timestamp":1693001141495},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"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":[[1981,12]]},"DOI":"10.1007\/bf01786987","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T13:17:33Z","timestamp":1119187053000},"page":"311-313","source":"Crossref","is-referenced-by-count":2,"title":["A note on complete sets and transitive closure"],"prefix":"10.1007","volume":"15","author":[{"given":"Ronald V.","family":"Book","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celia","family":"Wrathall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01786987_CR1","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1137\/0208035","volume":"8","author":"R. Book","year":"1979","unstructured":"R. Book. Polynomial space and transitive closure,SIAM J. Computing 8, 434\u2013439 (1979)","journal-title":"SIAM J. Computing"},{"key":"BF01786987_CR2","doi-asserted-by":"crossref","unstructured":"S. Cook. The complexity of theorem-proving procedures,Proc. ACM Symp. Theory of Computing, 151\u2013158 (1971).","DOI":"10.1145\/800157.805047"},{"key":"BF01786987_CR3","doi-asserted-by":"crossref","unstructured":"J. Hartmanis and J. Simon. On the power of multiplication in random access machines,15th IEEE Symp. Switching and Automata Theory, 13\u201323 (1974).","DOI":"10.1109\/SWAT.1974.20"},{"key":"BF01786987_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(68)91096-6","volume":"13","author":"N. Jones","year":"1968","unstructured":"N. Jones. Classes of automata and transitive closure,Info. Control 13, 207\u2013229 (1968).","journal-title":"Info. Control"},{"key":"BF01786987_CR5","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"R. Karp. Reducibilities among combinatorial problems,Complexity of Computer Computations (R. Miller, J. Thatcher, eds.). New York: Plenum Press, 1972."},{"key":"BF01786987_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"L. Stockmeyer. The polynomial-time hierarchy,Theoret. Comp. Sci. 3, 1\u201322 (1977).","journal-title":"Theoret. Comp. Sci."},{"key":"BF01786987_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1977","unstructured":"C. Wrathall. Complete sets and the polynomial-time hierarchy,Theoret. Comp. Sci. 3, 23\u201333 (1977).","journal-title":"Theoret. Comp. Sci."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01786987.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01786987\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01786987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T09:12:11Z","timestamp":1557479531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01786987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01786987"],"URL":"https:\/\/doi.org\/10.1007\/bf01786987","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}