{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T22:28:51Z","timestamp":1673389731950},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":7837,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0304-3975(92)90335-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"303-319","source":"Crossref","is-referenced-by-count":10,"title":["An arithmetic model of computation equivalent to threshold circuits"],"prefix":"10.1016","volume":"93","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[]},{"given":"Gudmund","family":"Frandsen","sequence":"additional","affiliation":[]},{"given":"Carl","family":"Sturtivant","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90335-D_BIB1","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1137\/0215070","article-title":"Log depth circuits for division and related problems","volume":"15","author":"Beame","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90335-D_BIB2","series-title":"Tech. Report DAIMI IR-71","article-title":"Computations in finite fields","author":"B\u00f8gestrand","year":"1988"},{"key":"10.1016\/0304-3975(92)90335-D_BIB3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90335-D_BIB4","series-title":"Tech. Report DAIMI PB-240","article-title":"The depth efficacy of unbounded characteristic finite field arithmetic","author":"Frandsen","year":"1988"},{"key":"10.1016\/0304-3975(92)90335-D_BIB5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits and the polynomial-time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(92)90335-D_BIB6","series-title":"Proc. 28th IEEE Symp. on Foundations of Computer Science","first-page":"99","article-title":"Threshold circuits of bounded depth","author":"Hajnal","year":"1987"},{"key":"10.1016\/0304-3975(92)90335-D_BIB7","series-title":"Algebra","author":"Hungerford","year":"1974"},{"key":"10.1016\/0304-3975(92)90335-D_BIB8","article-title":"Finite Fields","volume":"20","author":"Lidl","year":"1983"},{"key":"10.1016\/0304-3975(92)90335-D_BIB9","series-title":"Threshold Logic and its Applications","author":"Muroga","year":"1971"},{"key":"10.1016\/0304-3975(92)90335-D_BIB10","series-title":"Combinatorial Optimization. Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0304-3975(92)90335-D_BIB11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01137685","article-title":"Lower bounds on the size of bounded depth circuits over a complete basis with logical addition","volume":"41","author":"Razborov","year":"1987","journal-title":"Math. Notes"},{"key":"10.1016\/0304-3975(92)90335-D_BIB12","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987","journal-title":"Proc. 19th ACM STOC"},{"key":"10.1016\/0304-3975(92)90335-D_BIB13","series-title":"Technical Report DAIMI PB-227","article-title":"The computational efficacy of finite field arithmetic","author":"Sturtivant","year":"1987"},{"key":"10.1016\/0304-3975(92)90335-D_BIB14","first-page":"171","article-title":"Boolean circuits versus arithmetic circuits","author":"von zur Gathen","year":"1986","journal-title":"Proc. 6th Internat. Conf. in Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290335D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290335D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:59Z","timestamp":1555127819000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290335D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["030439759290335D"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90335-d","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}