{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:54:56Z","timestamp":1648824896047},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0020-0190(94)00037-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"199-203","source":"Crossref","is-referenced-by-count":2,"title":["Directed monotone contact networks for threshold functions"],"prefix":"10.1016","volume":"50","author":[{"given":"Jaikumar","family":"Radhakrishnan","sequence":"first","affiliation":[]},{"given":"K.V.","family":"Subrahmanyam","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00037-9_BIB1","first-page":"27","article-title":"Amplification of probabilistic Boolean formulas","volume":"5","author":"Boppana","year":"1989","journal-title":"Adv. Comput. Research"},{"key":"10.1016\/0020-0190(94)00037-9_BIB2","series-title":"Handbook of Theoretical Computer Science","first-page":"759","article-title":"The complexity of finite functions","author":"Boppana","year":"1990"},{"key":"10.1016\/0020-0190(94)00037-9_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1992.267766","article-title":"Amplification and percolation","author":"Dubiner","year":"1992","journal-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)00037-9_BIB4","first-page":"6037","article-title":"Nombre minimal de contacts de fermature n\u00e9cessaires pour r\u00e9aliser une fonction bool\u00e9enne sym\u00e9trique de n variables","volume":"258","author":"Hansel","year":"1964","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0020-0190(94)00037-9_BIB5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0403021","article-title":"Monotone circuits for connectivity require superlogarithmic depth","volume":"3","author":"Karchmer","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(94)00037-9_BIB6","first-page":"770","article-title":"Complexity of contact circuits realizing a function of logical algebra","volume":"8","author":"Krichevskii","year":"1964","journal-title":"Soviet Phys. Dokl."},{"key":"10.1016\/0020-0190(94)00037-9_BIB7","first-page":"486","article-title":"On comparing the complexity of realization of monotone contact networks containing only closing contacts and by arbitrary contact networks","volume":"7","author":"Lupanov","year":"1962","journal-title":"Soviet Phys. Dokl."},{"key":"10.1016\/0020-0190(94)00037-9_BIB8","first-page":"117","article-title":"On minimal switching-and-rectifier networks for monotone symmetric functions","volume":"8","author":"Markov","year":"1962","journal-title":"Problems of Cybernetics"},{"key":"10.1016\/0020-0190(94)00037-9_BIB9_1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0016-0032(56)90559-2","article-title":"Reliable circuits using less reliable relays","volume":"262","author":"Moore","year":"1956","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0020-0190(94)00037-9_BIB9_2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0016-0032(56)90044-8","article-title":"Reliable circuits using less reliable relays","volume":"262","author":"Moore","year":"1956","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0020-0190(94)00037-9_BIB10","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/SFCS.1991.185384","article-title":"Better bounds for threshold formulas","author":"Radhakrishnan","year":"1991","journal-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science"},{"issue":"6","key":"10.1016\/0020-0190(94)00037-9_BIB11","doi-asserted-by":"crossref","first-page":"1226","DOI":"10.1007\/BF01240265","article-title":"Lower bounds of the complexity of symmetric Boolean functions of contact-rectifier circuits","volume":"48","author":"Razborov","year":"1990","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"10.1016\/0020-0190(94)00037-9_BIB12","first-page":"47","article-title":"Lower bounds for deterministic and non-deterministic branching programs","volume":"529","author":"Razborov","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000379?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000379?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:50:36Z","timestamp":1555145436000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0020019094000379"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00037-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}