{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:59Z","timestamp":1725559139581},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_5","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"28-40","source":"Crossref","is-referenced-by-count":0,"title":["On the Monotone Circuit Complexity of Quadratic Boolean Functions"],"prefix":"10.1007","author":[{"given":"Kazuyuki","family":"Amano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF02579382","volume":"6","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Eigenvalues, Geometric Expanders, Sorting in Rounds, and Ramsey Theory. Combinatorica\u00a06, 207\u2013219 (1986)","journal-title":"Combinatorica"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579196","volume":"7","author":"N. Alon","year":"1987","unstructured":"Alon, N., Boppana, R.: The Monotone Circuit Complexity of Boolean Functions. Combinatorica\u00a07(1), 1\u201322 (1987)","journal-title":"Combinatorica"},{"issue":"3","key":"5_CR3","first-page":"530","volume":"31","author":"A. Andreev","year":"1985","unstructured":"Andreev, A.: On a Method for Obtaining Lower Bounds for the Complexity of Individual Monotone Functions. Soviet Math. Dokl.\u00a031(3), 530\u2013534 (1985)","journal-title":"Soviet Math. Dokl."},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/S009753970138445X","volume":"33","author":"K. Amano","year":"2004","unstructured":"Amano, K., Maruoka, A.: The Potential of the Approximation Method. SIAM J. Comput.\u00a033(2), 433\u2013447 (2004); Preliminary version in : Proc. of 37th FOCS 431\u2013440 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s000370050017","volume":"8","author":"C. Berg","year":"1999","unstructured":"Berg, C., Ulfberg, S.: Symmetric Approximation Arguments for Monotone Lower Bounds Without Sunflowers. Computational Complexity\u00a08(1), 1\u201320 (1999)","journal-title":"Computational Complexity"},{"key":"5_CR6","volume-title":"The Complexity of Boolean Networks","author":"P.E. Dunne","year":"1988","unstructured":"Dunne, P.E.: The Complexity of Boolean Networks. Academic Press, London (1988)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Haken, A.: Counting Bottlenecks to Show Monotone P\u2260NP. In: Proc. of 36th FOCS, pp. 36\u201340 (1995)","DOI":"10.1109\/SFCS.1995.492460"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Harnik, D., Raz, R.: Higher Lower Bounds for Monotone Size. In: Proc. of 32nd STOC, pp. 191\u2013201 (2000)","DOI":"10.1145\/335305.335349"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s004930050046","volume":"19","author":"S. Jukna","year":"1999","unstructured":"Jukna, S.: Combinatorics of Monotone Computations. Combinatorica\u00a019(1), 65\u201385 (1999)","journal-title":"Combinatorica"},{"key":"5_CR10","unstructured":"Jukna, S.: On Graph Complexity. In: ECCC TR04-004 (2004)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(91)90194-7","volume":"81","author":"K. Lenz","year":"1991","unstructured":"Lenz, K., Wegener, I.: The Conjunctive Complexity of Quadratic Boolean Functions. Theor. Comput. Sci.\u00a081, 257\u2013268 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00224-002-1068-0","volume":"36","author":"S.V. Lokam","year":"2003","unstructured":"Lokam, S.V.: Graph Complexity and Slice Functions. Theory Comput. Syst.\u00a036, 71\u201388 (2003)","journal-title":"Theory Comput. Syst."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF00268321","volume":"12","author":"K. Mehlhorn","year":"1979","unstructured":"Mehlhorn, K.: Some Remarks on Boolean Sums. Acta Inf.\u00a012, 371\u2013375 (1979)","journal-title":"Acta Inf."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF00279952","volume":"25","author":"P. Pudl\u00e1k","year":"1988","unstructured":"Pudl\u00e1k, P., R\u0151dl, V., Savick\u00fd, P.: Graph Complexity. Acta Inf.\u00a025, 515\u2013535 (1988)","journal-title":"Acta Inf."},{"key":"5_CR15","first-page":"354","volume":"31","author":"A. Razborov","year":"1985","unstructured":"Razborov, A.: Lower Bounds on the Monotone Complexity of Some Boolean Function. Soviet Math. Dokl.\u00a031, 354\u2013357 (1985)","journal-title":"Soviet Math. Dokl."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Razborov, A.: On the Method of Approximation. In: Proc. 21th STOC, pp. 167\u2013176 (1989)","DOI":"10.1145\/73007.73023"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jcss.1997.1494","volume":"55","author":"A. Razborov","year":"1997","unstructured":"Razborov, A., Rudich, S.: Natural Proofs. J. Comput. Syst. Sci.\u00a055(1), 24\u201335 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1-2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0304-3975(99)00321-7","volume":"237","author":"J. Simon","year":"2000","unstructured":"Simon, J., Tsai, S.C.: On the Bottleneck Counting Argument. Theor. Comput. Sci.\u00a0237(1-2), 429\u2013437 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70326-1","volume":"2","author":"R. Tarjan","year":"1978","unstructured":"Tarjan, R.: Complexity of Monotone Networks for Computing Conjunctions. Ann. Disc. Math.\u00a02, 121\u2013133 (1978)","journal-title":"Ann. Disc. Math."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02579163","volume":"4","author":"Z. Tuza","year":"1984","unstructured":"Tuza, Z.: Covering of Graphs by Complete Bipartite Subgraphs, Complexity of 0-1 Martix. Combinatorica\u00a04, 111\u2013116 (1984)","journal-title":"Combinatorica"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(86)90176-3","volume":"43","author":"I. Wegener","year":"1986","unstructured":"Wegener, I.: More on the Complexity of Slice Functions. Theor. Comput. Sci.\u00a043, 201\u2013211 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR22","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner, Chichester (1987)"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/S0019-9958(83)80030-8","volume":"59","author":"J. Weiss","year":"1983","unstructured":"Weiss, J.: An \u03a9(n 3\/2) Lower Bound on the Complexity of Boolean Convolution. Info. and Cont.\u00a059, 84\u201388 (1983)","journal-title":"Info. and Cont."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0020-0190(96)00080-4","volume":"59","author":"U. Zwick","year":"1996","unstructured":"Zwick, U.: On the Number of ANDs versus the Number of ORs in Monotone Boolean Circuits. Inf. Process. Let.\u00a059, 29\u201330 (1996)","journal-title":"Inf. Process. Let."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T08:34:45Z","timestamp":1711614885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}