{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:56:24Z","timestamp":1649098584654},"reference-count":18,"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":[[2001,1]]},"DOI":"10.1137\/s0097539700370965","type":"journal-article","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T22:30:33Z","timestamp":1242858633000},"page":"460-476","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Formulas: A Lower Bound and Simulation"],"prefix":"10.1137","volume":"31","author":[{"given":"Vwani P.","family":"Roychowdhury","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farrokh","family":"Vatan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","reference":[{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/0218053"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(75)90075-0"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1985.0070"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1989.0099"},{"key":"R11","volume-title":"The complexity of Boolean networks","author":"Dunne Paul","year":"1988"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.4213\/rm892"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/0219046"},{"key":"R18","volume-title":"Quantum computation and quantum information","author":"Nielsen Michael","year":"2000"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242355"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.2614"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796298637"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1480"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90016-6"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1968-0226281-1"},{"key":"R26","volume-title":"The complexity of Boolean functions","author":"Wegener Ingo","year":"1987"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539700370965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T16:47:52Z","timestamp":1485708472000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/S0097539700370965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["10.1137\/S0097539700370965"],"URL":"https:\/\/doi.org\/10.1137\/s0097539700370965","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}