{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:35:46Z","timestamp":1760132146285},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,4,1]],"date-time":"1976-04-01T00:00:00Z","timestamp":197164800000},"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":13621,"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":[[1976,4]]},"DOI":"10.1016\/s0022-0000(76)80037-2","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"198-221","source":"Crossref","is-referenced-by-count":89,"title":["A characterization of the power of vector machines"],"prefix":"10.1016","volume":"12","author":[{"given":"Vaughan R.","family":"Pratt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry J.","family":"Stockmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(76)80037-2_bib1","series-title":"Proceedings of the Third Annual ACM Symposium on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0022-0000(76)80037-2_bib2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(74)80046-2","article-title":"An observation on time-storage trade off","volume":"9","author":"Cook","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(76)80037-2_bib3","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\/S0022-0000(76)80037-2_bib4","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01694180","article-title":"Computational complexity of random access stored program machines","volume":"5","author":"Hartmanis","year":"1971","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(76)80037-2_bib5","series-title":"Proceedings of the Fifteenth Annual Symposium on Switching and Automata Theory","first-page":"13","article-title":"On the power of multiplication in random access machines","author":"Hartmanis","year":"1974"},{"key":"10.1016\/S0022-0000(76)80037-2_bib6","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0022-0000(76)80037-2_bib7","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0022-0000(76)80037-2_bib8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linear-bounded automata","volume":"7","author":"Kuroda","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(76)80037-2_bib9","series-title":"IEEE Conf. Rec. Switching Circuit theory Logical Design","first-page":"191","article-title":"Memory bounds for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965"},{"key":"10.1016\/S0022-0000(76)80037-2_bib10","series-title":"Proceedings of the Sixth Annual ACM Symposium on the Theory of Computing","first-page":"122","article-title":"A characterization of the power of vector machines","author":"Pratt","year":"1974"},{"key":"10.1016\/S0022-0000(76)80037-2_bib11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(76)80037-2_bib12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","article-title":"Computability of recursive functions","volume":"10","author":"Shepherdson","year":"1963","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(76)80037-2_bib13","series-title":"IEEE Conf. Rec. Switching Circuit Theory Logical Design","first-page":"179","article-title":"Hierarchies of memory limited computations","author":"Stearns","year":"1965"},{"key":"10.1016\/S0022-0000(76)80037-2_bib14","series-title":"Proceedings of the Fifth Annual ACM Symposium on the Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000076800372?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000076800372?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:54:33Z","timestamp":1544140473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000076800372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976,4]]}},"alternative-id":["S0022000076800372"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(76)80037-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1976,4]]}}}