乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:24:19Z","timestamp":1649172259095},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"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":8202,"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,2]]},"DOI":"10.1016\/0890-5401(91)90003-k","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"178-193","source":"Crossref","is-referenced-by-count":0,"title":["Planar acyclic computation"],"prefix":"10.1016","volume":"90","author":[{"given":"W.F.","family":"McColl","sequence":"first","affiliation":[]},{"given":"M.S.","family":"Paterson","sequence":"additional","affiliation":[]},{"given":"B.H.","family":"Bowditch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90003-K_BIB1","series-title":"Proceedings, 21st Annual Allerton Conf","first-page":"258","article-title":"On simulation and interrelations between Boolean and VLSI circuits","author":"Aggarwal","year":"1983"},{"key":"10.1016\/0890-5401(91)90003-K_BIB2","author":"Borodin","year":"1975"},{"key":"10.1016\/0890-5401(91)90003-K_BIB3","author":"Dunne","year":"1988"},{"key":"10.1016\/0890-5401(91)90003-K_BIB4","series-title":"Proceedings, Mathematical Foundations of Computer Science 1986","first-page":"93","article-title":"Parallel arithmetic computations: A survey","volume":"Vol. 233","author":"von zur Gathen","year":"1986"},{"key":"10.1016\/0890-5401(91)90003-K_BIB5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0747-7171(87)80063-9","article-title":"Feasible arithmetic computations: Valiant's hypothesis","volume":"4","author":"van zur Gathen","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0890-5401(91)90003-K_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(87)90045-7","article-title":"Optimal three-dimensional layouts of complete binary trees","volume":"26","author":"Gupta","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90003-K_BIB7","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1137\/0215057","article-title":"Three-dimensional circuit layouts","volume":"15","author":"Leighton","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90003-K_BIB8","first-page":"59","article-title":"The communication complexity of VLSI circuits","volume":"31","author":"Lengauer","year":"1985"},{"key":"10.1016\/0890-5401(91)90003-K_BIB9","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90003-K_BIB10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TC.1981.1675758","article-title":"Planar crossovers","volume":"C-30","author":"McColl","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0890-5401(91)90003-K_BIB11","series-title":"Proceedings, 2nd Annual Symp. on Theoretical Aspects of Computer Science","first-page":"219","article-title":"On the planar monotone computation of threshold functions","volume":"Vol. 182","author":"McColl","year":"1985"},{"key":"10.1016\/0890-5401(91)90003-K_BIB12","series-title":"VLSI Algorithms and Architectures","first-page":"236","article-title":"Efficient parallel evaluation of straight-line code and arithmetic circuits","volume":"Vol. 227","author":"Miller","year":"1986"},{"key":"10.1016\/0890-5401(91)90003-K_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01744565","article-title":"Optimal three-dimensional VLSI layouts","volume":"16","author":"Preparata","year":"1983","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(91)90003-K_BIB14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0215017","article-title":"Logarithmic depth circuits for algebraic functions","volume":"15","author":"Reif","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90003-K_BIB15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/2402.322384","article-title":"Three-dimensional VLSI: A case study","volume":"30","author":"Rosenberg","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90003-K_BIB16","series-title":"VLSI Systems and Computations","first-page":"61","article-title":"Planar circuit complexity and the performance of VLSI algorithms","author":"Savage","year":"1981"},{"key":"10.1016\/0890-5401(91)90003-K_BIB17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0022-0000(84)90033-3","article-title":"The performance of multilective VLSI algorithms","volume":"29","author":"Savage","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90003-K_BIB18","author":"Ullman","year":"1984"},{"key":"10.1016\/0890-5401(91)90003-K_BIB19","author":"Wegener","year":"1987"},{"key":"10.1016\/0890-5401(91)90003-K_BIB20","author":"White","year":"1984"},{"key":"10.1016\/0890-5401(91)90003-K_BIB21","series-title":"Proceedings, 18th ACM Symp. on Theory of Computing","first-page":"104","article-title":"Four pages are necessary and sufficient for planar graphs","author":"Yannakakis","year":"1986"},{"key":"10.1016\/0890-5401(91)90003-K_BIB22","series-title":"VLSI Algorithms and Architectures","first-page":"226","article-title":"Linear and book embeddings of graphs","volume":"Vol. 227","author":"Yannakakis","year":"1986"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190003K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190003K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:48Z","timestamp":1548897948000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190003K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["089054019190003K"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90003-k","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}