{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T17:17:24Z","timestamp":1721323044434},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":5221,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1006\/jcss.1998.1617","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T10:19:44Z","timestamp":1032344384000},"page":"326-335","source":"Crossref","is-referenced-by-count":26,"title":["An Exponential Lower Bound for the Size of Monotone Real Circuits"],"prefix":"10.1006","volume":"58","author":[{"given":"Armin","family":"Haken","sequence":"first","affiliation":[]},{"given":"Stephen A.","family":"Cook","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jcss.1998.1617_RF1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579196","article-title":"The monotone circuit complexity of Boolean functions","volume":"7","author":"Alon","year":"1987","journal-title":"Combinatorica"},{"key":"10.1006\/jcss.1998.1617_RF2","first-page":"1033","article-title":"On a method for obtaining lower bounds for the complexity of individual monotone functions","volume":"282","author":"Andreev","year":"1985","journal-title":"Dok. Akad. Nauk SSSR"},{"key":"10.1006\/jcss.1998.1617_RF3","doi-asserted-by":"crossref","unstructured":"M. Bonet, T. Pitassi, R. Raz, Lower bounds for cutting planes proofs with small coefficients, Proc. Twenty-seventh Ann. ACM Symp. Theor. Comput, 1995, 575, 584","DOI":"10.1145\/225058.225275"},{"key":"10.1006\/jcss.1998.1617_RF4","series-title":"Handbook of Theoretical Computer Science, Vol. A, Algorthms and Complexity","article-title":"The complexity of finite functions","author":"Boppana","year":"1990"},{"key":"10.1006\/jcss.1998.1617_RF5","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/48014.48016","article-title":"Many hard examples for resolution","volume":"35","author":"Chv\u00e1tal","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1006\/jcss.1998.1617_RF6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","article-title":"On the complexity of cutting plane proofs","author":"Cook","year":"1987","journal-title":"Disc. Appl. Math."},{"key":"10.1006\/jcss.1998.1617_RF7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1006\/jcss.1998.1617_RF8","doi-asserted-by":"crossref","unstructured":"A. Haken, Counting bottlenecks to show monotone P\u2260NP, Proc. 36th Annual Symp. Foundations of Computer Science, 1995, 36, 40","DOI":"10.1109\/SFCS.1995.492460"},{"key":"10.1006\/jcss.1998.1617_RF9","unstructured":"P. Pudl\u00e1k, Direct proofs of interpolation theorems for resolution and cutting planes proof systems, February 1995"},{"key":"10.1006\/jcss.1998.1617_RF10","doi-asserted-by":"crossref","first-page":"981","DOI":"10.2307\/2275583","article-title":"Lower bounds for resolution and cutting plane proofs and monotone computations","volume":"62","author":"Pudl\u00e1k","year":"1997","journal-title":"J. Symbolic Logic"},{"key":"10.1006\/jcss.1998.1617_RF11","first-page":"798","article-title":"Lower bounds on the monotone complexity of some Boolean functions","volume":"281","author":"Razborov","year":"1985","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1006\/jcss.1998.1617_RF12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/7531.8928","article-title":"Hard examples for resolution","volume":"34","author":"Urquhart","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1006\/jcss.1998.1617_RF13","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000098916178?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000098916178?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T03:53:51Z","timestamp":1557374031000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000098916178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0022000098916178"],"URL":"https:\/\/doi.org\/10.1006\/jcss.1998.1617","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}