{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:32Z","timestamp":1759637792766},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1137\/0222022","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T11:38:56Z","timestamp":1109245136000},"page":"294-302","source":"Crossref","is-referenced-by-count":19,"title":["Limiting Negations in Constant Depth Circuits"],"prefix":"10.1137","volume":"22","author":[{"given":"Miklos","family":"Santha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","reference":[{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1145\/31846.31852"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579338"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1968.227401"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579196"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90027-9"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07407-4_9"},{"key":"R12","first-page":"694","volume":"4","author":"Markov A.","year":"1963","journal-title":"Soviet Math. Dokl."},{"key":"R13","first-page":"74","author":"Okolnishnikova E. A.","year":"1982","journal-title":"Metody Diskret. Analiz."},{"key":"R15","first-page":"798","volume":"281","author":"Razborov A. A.","year":"1985","journal-title":"Soviet Math. Dokl."},{"key":"R16","first-page":"393","volume":"7","author":"Tardos E.","year":"1987","journal-title":"Combinatorica"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90016-6"},{"key":"R18","volume-title":"The complexity of Boolean functions","author":"Wegener Ingo","year":"1987"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526633.011"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0222022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T17:26:24Z","timestamp":1485710784000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0222022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["10.1137\/0222022"],"URL":"https:\/\/doi.org\/10.1137\/0222022","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}