乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T17:10:56Z","timestamp":1724173856341},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10975,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1983,7]]},"DOI":"10.1016\/s0019-9958(83)80060-6","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T22:48:44Z","timestamp":1115419724000},"page":"113-136","source":"Crossref","is-referenced-by-count":102,"title":["Parallel computation for well-endowed rings and space-bounded probabilistic machines"],"prefix":"10.1016","volume":"58","author":[{"given":"A.","family":"Borodin","sequence":"first","affiliation":[]},{"given":"S.","family":"Cook","sequence":"additional","affiliation":[]},{"given":"N.","family":"Pippenger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(83)80060-6_bib1","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TEC.1961.5219227","article-title":"Signed-digit number representations for fast parallel arithmetic","volume":"10","author":"Avizienis","year":"1961","journal-title":"Inst. Radio Engr. Trans. Electron. Comput."},{"key":"10.1016\/S0019-9958(83)80060-6_bib2","series-title":"On computing the determinant in small parallel time using a small number of processors","author":"Berkowitz","year":"1982"},{"key":"10.1016\/S0019-9958(83)80060-6_bib3","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(83)80060-6_bib4","first-page":"65","article-title":"Fast parallel matrix and GCD computations","volume":"23","author":"Borodin","year":"1982"},{"key":"10.1016\/S0019-9958(83)80060-6_bib5","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/S0019-9958(83)80060-6_bib6","first-page":"99","article-title":"Towards a complexity theory of synchronous parallel computation","volume":"XXVII","author":"Cook","year":"1981","journal-title":"L'Enseignement math\u00e9matique"},{"key":"10.1016\/S0019-9958(83)80060-6_bib7","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","article-title":"Fast parallel matrix inversion algorithms","volume":"5","author":"Csanky","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(83)80060-6_bib8","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(83)80060-6_bib9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(80)90063-8","article-title":"Deterministic simulation of tape-bounded probabilistic Turing machine transducers","volume":"12","author":"Gill","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(83)80060-6_bib10","series-title":"Formal Languages and Their relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0019-9958(83)80060-6_bib11","series-title":"Ph.D. dissertation","article-title":"Topics in Probabilistic Complexity","author":"Hunt","year":"1978"},{"key":"10.1016\/S0019-9958(83)80060-6_bib12","series-title":"10th Sympos. on Mathematical Foundations of Computer Science","first-page":"339","article-title":"Relationships between probabilistic and deterministic tape complexity","author":"Jung","year":"1981"},{"key":"10.1016\/S0019-9958(83)80060-6_bib13","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(83)80060-6_bib14","first-page":"589","article-title":"On the algorithmic complexity of discrete functions","volume":"7","author":"Ofman","year":"1963","journal-title":"Soviet. Phys. Dokl."},{"key":"10.1016\/S0019-9958(83)80060-6_bib15","first-page":"307","article-title":"On simultaneous resource bounds","volume":"20","author":"Pippenger","year":"1979"},{"key":"10.1016\/S0019-9958(83)80060-6_bib16","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(83)80060-6_bib17","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/S0019-9958(83)80060-6_bib18","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\/S0019-9958(83)80060-6_bib19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0304-3975(81)90032-3","article-title":"On tape-bounded probabilistic Turing machine acceptors","volume":"16","author":"Simon","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(83)80060-6_bib20","first-page":"158","article-title":"Space-bounded probabilistic Turing machine complexity classes are closed under complement","volume":"13","author":"Simon","year":"1981"},{"key":"10.1016\/S0019-9958(83)80060-6_bib21","first-page":"107","article-title":"On tape-bounded probabilistic Turing machine transducers (extended abstract)","volume":"19","author":"Simon","year":"1978"},{"key":"10.1016\/S0019-9958(83)80060-6_bib22","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321264.321279","article-title":"On the time required to perform addition","volume":"12","author":"Winograd","year":"1965","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(83)80060-6_bib23","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1145\/321420.321438","article-title":"On the time required to perform multiplication","volume":"14","author":"Winograd","year":"1967","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800606?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800606?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:27:58Z","timestamp":1548523678000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995883800606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1983,7]]}},"alternative-id":["S0019995883800606"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(83)80060-6","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}