{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:50:11Z","timestamp":1649040611978},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0141-9331(95)93087-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:14:28Z","timestamp":1027613668000},"page":"43-50","source":"Crossref","is-referenced-by-count":3,"title":["Modelling the complexity of parallel and VLSI computations with Boolean circuits"],"prefix":"10.1016","volume":"19","author":[{"given":"Constantinos V.","family":"Papadopoulos","sequence":"first","affiliation":[]},{"given":"Theodoros S.","family":"Andronikos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0141-9331(95)93087-Y_BIB1","series-title":"IEEE Conference of Switching Circuit Theory and Logical Design","first-page":"179","article-title":"Hierarchies memory limited computations","author":"Hartmanis","year":"1965"},{"issue":"No 4","key":"10.1016\/0141-9331(95)93087-Y_BIB2","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"Vol 6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"No 2","key":"10.1016\/0141-9331(95)93087-Y_BIB3","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/322123.322138","article-title":"Relations among complexity measures","volume":"Vol 26","author":"Pippenger","year":"1979","journal-title":"JACM"},{"issue":"No 1","key":"10.1016\/0141-9331(95)93087-Y_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits and the polynomial-time hierarchy","volume":"Vol 17","author":"Furst","year":"1984","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB5","article-title":"Lower bounds for the size of circuits of bounded depth with basis AND, XOR","volume":"Vol 65","author":"Razborov","year":"1986","journal-title":"Matem. Zam."},{"key":"10.1016\/0141-9331(95)93087-Y_BIB6","first-page":"1","article-title":"Seperating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985","journal-title":"26th FOCS"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB7","first-page":"6","article-title":"Almost optimal lower bounds for smart depth circuits","author":"Hastad","year":"1986","journal-title":"18th STOC"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB8","article-title":"With probability one a random oracle separates PSPACE from the polynomial hierarchy","author":"Cai","year":"1986","journal-title":"18 STOC"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB9","series-title":"19th Symposium on Theory of Computation","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB10","doi-asserted-by":"crossref","DOI":"10.1145\/1008620.1008621","article-title":"A time-space tradeoff for sorting and related non-oblivious computations","author":"Borodin","year":"1979"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB11","article-title":"Bounds for width two branching programs","author":"Borodin","year":"1983","journal-title":"15th STOC"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB12","article-title":"Multi-part protocols","author":"Chandra","year":"1983","journal-title":"15th STOC"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB13","series-title":"Proc. 27 ACM Foundations of Computer Science","first-page":"410","article-title":"Meanders, Ramsey Theory and lower bounds for branching programs","author":"Alon","year":"1986"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB14","series-title":"Proceedings Conf. on the Math. Foundations of Computer Science","first-page":"480","article-title":"A lower bound on the complexity of branching programs","volume":"176","author":"Pudlak","year":"1984"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB15","series-title":"Proc. 18th ACM STOC","first-page":"30","article-title":"Two lower bounds for branching programs","author":"Ajtai","year":"1986"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB16","first-page":"1","article-title":"Bounded-width polynomial-size branching programs recognize exactly those language in NC","author":"Barrington","year":"1986","journal-title":"18th STOC"},{"issue":"No 4","key":"10.1016\/0141-9331(95)93087-Y_BIB17","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/321724.321731","article-title":"Computational work and time on finite machines","volume":"Vol 19","author":"Savage","year":"1972","journal-title":"JACM"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB18","first-page":"1","article-title":"The polynomial-time hierarchy","author":"Stockmeyer","year":"1977","journal-title":"TCS3"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB19","series-title":"Fifth ACM Symposium on Theory of Computing","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"},{"key":"10.1016\/0141-9331(95)93087-Y_BIB20","article-title":"A complexity theory for unbounded fan-in parallelism","author":"Chandra","year":"1986"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014193319593087Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:014193319593087Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T07:55:06Z","timestamp":1556265306000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/014193319593087Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["014193319593087Y"],"URL":"https:\/\/doi.org\/10.1016\/0141-9331(95)93087-y","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}