{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:12:59Z","timestamp":1733548379270,"version":"3.30.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":4855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0304-3975(99)00321-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:30:39Z","timestamp":1027650639000},"page":"429-437","source":"Crossref","is-referenced-by-count":5,"title":["On the bottleneck counting argument"],"prefix":"10.1016","volume":"237","author":[{"given":"Janos","family":"Simon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Chun","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(99)00321-7_BIB1","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"},{"year":"1991","series-title":"The Probabilistic Method","author":"Alon","key":"10.1016\/S0304-3975(99)00321-7_BIB2"},{"key":"10.1016\/S0304-3975(99)00321-7_BIB3","doi-asserted-by":"crossref","unstructured":"K. Amano, A. Maruoka, Potential of the approximation method, Proc. 37th Symp. on Foundations of Computer Science, 1996, pp. 431\u2013440.","DOI":"10.1109\/SFCS.1996.548502"},{"key":"10.1016\/S0304-3975(99)00321-7_BIB4","first-page":"530","article-title":"On a method for obtaining lower bounds for the complexity of individual monotone functions","volume":"31","author":"Andreev","year":"1985","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0304-3975(99)00321-7_BIB5","doi-asserted-by":"crossref","unstructured":"C. Berg, S. Ulfberg, Symmetric approximation arguments for monotone lower bounds without sunflowers, Computat. Complexity, in preparation.","DOI":"10.1007\/s000370050017"},{"key":"10.1016\/S0304-3975(99)00321-7_BIB6","doi-asserted-by":"crossref","unstructured":"M. Golmann, J. H\u00e5stad, Monotone circuits for connectivity have depth (log n)2\u2212o(1), Proc. 27th Ann. ACM Symp. the Theory of Computing, 1995, pp. 569\u2013574.","DOI":"10.1145\/225058.225274"},{"key":"10.1016\/S0304-3975(99)00321-7_BIB7","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.1016\/S0304-3975(99)00321-7_BIB8","doi-asserted-by":"crossref","unstructured":"A. Haken, Counting bottlenecks to show monotone P\u2260 NP, Proc. 36th Symp. on Foundations of Computer Science, 1995, pp. 36\u201340.","DOI":"10.1109\/SFCS.1995.492460"},{"key":"10.1016\/S0304-3975(99)00321-7_BIB9","doi-asserted-by":"crossref","unstructured":"S. Jukna, Finite limits and monotone computations over reals, Proc. 12th Ann. IEEE Conf. on Computational Complexity, 1997, pp. 302\u2013313.","DOI":"10.1109\/CCC.1997.612325"},{"key":"10.1016\/S0304-3975(99)00321-7_BIB10","doi-asserted-by":"crossref","unstructured":"M. Karchmer, On proving lower bounds for circuit size, Proc. 8th Ann. IEEE Conf. of Structure in Complexity Theory, 1993, pp. 112\u2013118.","DOI":"10.1109\/SCT.1993.336535"},{"key":"10.1016\/S0304-3975(99)00321-7_BIB11","doi-asserted-by":"crossref","unstructured":"N. Pippinger, On networks of noisy gates, Proc. 26th Symp. Foundations of Computer Science, 1985, pp. 30\u201338.","DOI":"10.1109\/SFCS.1985.41"},{"key":"10.1016\/S0304-3975(99)00321-7_BIB12","first-page":"354","article-title":"Lower bounds on the monotone complexity of some boolean functions","volume":"31","author":"Razborov","year":"1985","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0304-3975(99)00321-7_BIB13","doi-asserted-by":"crossref","unstructured":"A.A. Razborov, On the method of approximations, Proc. 21st Ann. ACM Symp. on the Theory of Computing, 1989, pp. 167\u2013176","DOI":"10.1145\/73007.73023"},{"year":"1987","series-title":"The Complexity of Boolean Functions","author":"Wegener","key":"10.1016\/S0304-3975(99)00321-7_BIB14"},{"key":"10.1016\/S0304-3975(99)00321-7_BIB15","doi-asserted-by":"crossref","unstructured":"A.C. Yao, A lower bound for the monotone depth of connectivity, Proc. 35th Symp. on Foundations of Computer Science, 1994, pp. 302\u2013308.","DOI":"10.1109\/SFCS.1994.365685"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T14:37:11Z","timestamp":1733495831000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599003217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0304397599003217"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00321-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}