乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:00:57Z","timestamp":1648990857768},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0890-5401(91)90061-6","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"86-106","source":"Crossref","is-referenced-by-count":4,"title":["Some classes of languages in NC1"],"prefix":"10.1016","volume":"90","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Jik H.","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Bala","family":"Ravikumar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90061-6_BIB1","doi-asserted-by":"crossref","DOI":"10.1145\/76359.76370","article-title":"P-uniform Circuit Complexity","author":"Allender","year":"1986"},{"key":"10.1016\/0890-5401(91)90061-6_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/990502.990506","article-title":"A language over a one symbol alphabet requiring only O(log log n) space","author":"Alt","year":"1975","journal-title":"SIGACT Newsletter"},{"key":"10.1016\/0890-5401(91)90061-6_BIB3","article-title":"Eine untere Schranke f\u00fcr den Platzbedarf bei der Analyse beschrankter kontextfreier Sprachen","author":"Alt","year":"1976","journal-title":"Dissertation"},{"key":"10.1016\/0890-5401(91)90061-6_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF00264016","article-title":"Lower bounds on space complexity for context-free recognition","volume":"12","author":"Alt","year":"1979","journal-title":"Acta Inform."},{"key":"10.1016\/0890-5401(91)90061-6_BIB5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","article-title":"Reversal-bounded multipushdown machines","volume":"8","author":"Baker","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90061-6_BIB6","series-title":"Proceedings, 18th Annual Symp. on Theory of Computing","first-page":"1","article-title":"Bounded-width polynomial-size branching programs recognize exactly those languages in NC1","author":"Barrington","year":"1986"},{"key":"10.1016\/0890-5401(91)90061-6_BIB7","series-title":"Proceedings, 19th Annual Symp. on Theory of Computing","first-page":"123","article-title":"Boolean formula-value problem is in ALOGTIME","author":"Buss","year":"1987"},{"key":"10.1016\/0890-5401(91)90061-6_BIB8","series-title":"Proceedings, 13th Annual Symp. on Theory of Computing","first-page":"146","article-title":"Reversal complexity of counter machines","author":"Chan","year":"1981"},{"issue":"No. 1","key":"10.1016\/0890-5401(91)90061-6_BIB9","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90061-6_BIB10","article-title":"On Some Languages in NC1","author":"Chang","year":"1986"},{"key":"10.1016\/0890-5401(91)90061-6_BIB11","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90061-6_BIB12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(83)90096-8","article-title":"One-way simple multihead finite automata are not closed under concatenation","volume":"27","author":"Duris","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90061-6_BIB13","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0022-0000(75)80052-3","article-title":"Space bounds for processing contentless inputs","volume":"11","author":"Freedman","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90061-6_BIB14","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0890-5401(91)90061-6_BIB15","first-page":"5","article-title":"A note on the recognition of one counter languages","volume":"R-2","author":"Greibach","year":"1975","journal-title":"RAIRO"},{"key":"10.1016\/0890-5401(91)90061-6_BIB16","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1145\/322139.322152","article-title":"An NP-complete number theoretic problem","volume":"26","author":"Gurari","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90061-6_BIB17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0304-3975(81)80003-5","article-title":"The complexity of the equivalence problem for two characterizations of Presburger sets","volume":"13","author":"Gurari","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90061-6_BIB18","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","article-title":"The complexity of decision problems for finite-turn multicounter machines","volume":"22","author":"Gurari","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90061-6_BIB19","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/S0019-9958(68)90901-7","article-title":"Multitape and multihead pushdown automata","volume":"13","author":"Harrison","year":"1968","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90061-6_BIB20","author":"Harrison","year":"1978"},{"key":"10.1016\/0890-5401(91)90061-6_BIB21","author":"Hopcroft","year":"1979"},{"issue":"No. 1","key":"10.1016\/0890-5401(91)90061-6_BIB22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(74)90043-X","article-title":"A note on semilinear sets and reversal-bounded multihead pushdown automata","volume":"3","author":"Ibarra","year":"1974","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90061-6_BIB23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0022-0000(76)80026-8","article-title":"A useful device for showing the solvability of some decision problems","volume":"13","author":"Ibarra","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90061-6_BIB24","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"Ibarra","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90061-6_BIB25","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(88)90047-6","article-title":"Some subclasses of context-free languages in NC1","volume":"29","author":"Ibarra","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90061-6_BIB26","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(79)90033-1","article-title":"One-way simple multihead finite automata","volume":"9","author":"Inoue","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90061-6_BIB27","series-title":"IEEE Conf. Record on Switching Circuit Theory and Logical Design","first-page":"191","article-title":"Memory bounds for the recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965"},{"key":"10.1016\/0890-5401(91)90061-6_BIB28","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/S0022-0000(70)80015-0","article-title":"A characterization of semilinear sets","volume":"4","author":"Liu","year":"1970","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0890-5401(91)90061-6_BIB29","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","article-title":"Bounds to complexities of networks for sorting and for switching","volume":"22","author":"Muller","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90061-6_BIB30","series-title":"20th IEEE Foundations of Computer Science","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979"},{"key":"10.1016\/0890-5401(91)90061-6_BIB31","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\/0890-5401(91)90061-6_BIB32","first-page":"313","article-title":"Language recognition by marking automata","volume":"4","author":"Springsteel","year":"1972","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90061-6_BIB33","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"Tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90061-6_BIB34","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/321906.321913","article-title":"A note on tape-bounded complexity classes and linear context-free languages","volume":"22","author":"Sudborough","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90061-6_BIB35","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/0020-0190(81)90013-2","article-title":"An extension of Savitch's theorem to small space bounds","volume":"12","author":"Tompa","year":"1981","journal-title":"Inform. Process. Lett."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900616?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900616?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:25:30Z","timestamp":1549045530000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540191900616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0890540191900616"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90061-6","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}