{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:07:43Z","timestamp":1752538063681,"version":"3.41.2"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1109\/sfcs.1994.365684","type":"proceedings-article","created":{"date-parts":[[2002,12,17]],"date-time":"2002-12-17T11:08:05Z","timestamp":1040123285000},"page":"309-317","source":"Crossref","is-referenced-by-count":0,"title":["Efficient oblivious branching programs for threshold functions"],"prefix":"10.1109","author":[{"given":"R.K.","family":"Sinha","sequence":"first","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.S.","family":"Thathachar","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci. & Eng., Washington Univ., Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808737"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"ref12","first-page":"85","article-title":"On the problem of realization of symmetric Boolean functions by contact schemes","volume":"15","author":"lupanov","year":"1965","journal-title":"Probl Kibernet"},{"key":"ref13","first-page":"999","article-title":"On a Boolean function","volume":"7","author":"ne?iporuk","year":"1966","journal-title":"Soviet Math Doklady"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030331"},{"key":"ref15","first-page":"449","article-title":"The hierarchy of Boolean circuits","volume":"6","author":"pudl\ufffdk","year":"1987","journal-title":"Computers and Artificial Intelligence"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01240265"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54458-5_49"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","article-title":"Approximate formulas for some functions of prime numbers","volume":"6","author":"rosser","year":"1962","journal-title":"Illinois Journal of Mathematics"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","article-title":"Mix Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC<superscript>1<\/superscript>","volume":"38","author":"david","year":"1989","journal-title":"Journal of Computer and System Sciences"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90002-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200404"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90080-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160274"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1978.1675141"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12134"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1145\/127601.127703","article-title":"Using bdds to verify multipliers","author":"burch","year":"1991","journal-title":"28th ACM\/IEEE Design Automation Conference DAC"}],"event":{"name":"Proceedings 35th Annual Symposium on Foundations of Computer Science","start":{"date-parts":[[1994,11,20]]},"location":"Santa Fe, NM, USA","end":{"date-parts":[[1994,11,22]]}},"container-title":["Proceedings 35th Annual Symposium on Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx2\/2955\/8384\/00365684.pdf?arnumber=365684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T17:41:14Z","timestamp":1752514874000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/365684\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/sfcs.1994.365684","relation":{},"subject":[],"published":{"date-parts":[[1994]]}}}