{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:46:58Z","timestamp":1740894418290,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653844"},{"type":"electronic","value":"9783540493822"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-540-49382-2_29","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T04:37:34Z","timestamp":1294461454000},"page":"307-318","source":"Crossref","is-referenced-by-count":0,"title":["Remarks on Graph Complexity"],"prefix":"10.1007","author":[{"given":"Satyanarayana V.","family":"Lokam","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"29_CR1","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"},{"doi-asserted-by":"crossref","unstructured":"Babai, L., Frankl, P., Simon, J.: Complexity classes in Communication Complexity Theory. In: 26th IEEE FOCS, pp. 337\u2013347 (1986)","key":"29_CR2","DOI":"10.1109\/SFCS.1986.15"},{"unstructured":"Berkowitz, S.: On some Relationships Between Monotone and Nonmonotone Circuit Complexity, Technical Report, University of Toronto (1982)","key":"29_CR3"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/BF00264314","volume":"23","author":"S. Bublitz","year":"1986","unstructured":"Bublitz, S.: Decomposition of Graphs and Monotone Formula size of Homogeneous Functions. Acta Informatika\u00a023, 689\u2013696 (1986)","journal-title":"Acta Informatika"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(86)90122-2","volume":"44","author":"P. Dunne","year":"1986","unstructured":"Dunne, P.: The Complexity of Central Slice Functions. Theoretical Computer Science\u00a044, 247\u2013257 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"29_CR6","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/0215047","volume":"15","author":"J. Friedman","year":"1986","unstructured":"Friedman, J.: Constructing O(n log n) size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables. SIAM jl. Comp.\u00a015(3), 641\u2013654 (1986)","journal-title":"SIAM jl. Comp."},{"key":"29_CR7","volume-title":"Advances in Computer Research: Randomness and Computation","author":"J. H\u00e5stad","year":"1989","unstructured":"H\u00e5stad, J.: Almost Optimal Lower Bounds for Small Depth Circuits. In: Micali, S. (ed.) Advances in Computer Research: Randomness and Computation, vol.\u00a05. JAI Press, Greenwich (1989)"},{"doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Jukna, S., Pudl\u00e1k, P.: Top-Down Lower Bounds for Depth-3 Circuits. In: 34th IEEE FOCS, pp. 124\u2013129","key":"29_CR8","DOI":"10.1109\/SFCS.1993.366875"},{"unstructured":"Hayes, T., Kutin, S.: Personal communication","key":"29_CR9"},{"doi-asserted-by":"crossref","unstructured":"Nisan, N., Szegedy, M.: On the degree of Boolean Functions as Real Polynomials. In: 24th ACM STOC, pp. 462\u2013467 (1991)","key":"29_CR10","DOI":"10.1145\/129712.129757"},{"doi-asserted-by":"crossref","unstructured":"Krause, M., Waack, S.: Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits having Symmetric Gates with Unbounded fan-in. In: 32nd IEEE FOCS, pp. 777\u2013782 (1991)","key":"29_CR11","DOI":"10.1109\/SFCS.1991.185448"},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0403021","volume":"3","author":"M. Karchmer","year":"1990","unstructured":"Karchmer, M., Wigderson, A.: Monotone Circuits for Connectivity require Sper-Logarithmic Depth. SIAM jl. Disc. Math.\u00a03(2), 255\u2013265 (1990)","journal-title":"SIAM jl. Disc. Math."},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF00279952","volume":"25","author":"P. Pudl\u00e1k","year":"1988","unstructured":"Pudl\u00e1k, P., R\u00f6dl, V., Savick\u00fd, P.: Graph Complexity. Acta Informatica\u00a025, 515\u2013535 (1988)","journal-title":"Acta Informatica"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF01204724","volume":"14","author":"P. Pudl\u00e1k","year":"1992","unstructured":"Pudl\u00e1k, P., R\u00f6dl, V.: A Combinatorial Approach to Complexity. Combinatorica\u00a014, 221\u2013226 (1992)","journal-title":"Combinatorica"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(94)00115-Y","volume":"136","author":"P. Pudl\u00e1k","year":"1994","unstructured":"Pudl\u00e1k, P., R\u00f6dl, V.: Some Combinatorial-Algebraic Problems from Complexity Theory. Discrete Mathematics\u00a0136, 253\u2013279 (1994)","journal-title":"Discrete Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Paturi, R., Saks, M., Zane, F.: Exponential Lower Bounds on Depth 3 Boolean Circuits. In: 29th ACM STOC (1997)","key":"29_CR16","DOI":"10.1145\/258533.258556"},{"doi-asserted-by":"crossref","unstructured":"Paturi, R., Pudl\u00e1k, P., Zane, F.: Satisfiability Coding Lemma. In: 38th IEEE FOCS, pp. 566\u2013574 (1997)","key":"29_CR17","DOI":"10.1109\/SFCS.1997.646146"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02122698","volume":"10","author":"A.A. Razborov","year":"1990","unstructured":"Razborov, A.A.: Applications of MatrixMet hods for the theory of Lower Bounds in Computational Complexity. Combinatorica\u00a010, 81\u201393 (1990)","journal-title":"Combinatorica"},{"unstructured":"Razborov, A.A.: Lower Bounds on the size of Bounded Depth Networks over a Complete Basis with Logical Addition. Mat. Zametki 41(4), 598\u2013607 (1987) (in Russian); English translation in: Math. Notes\u00a041(4), 333\u2013338 (1987)","key":"29_CR19"},{"unstructured":"Razborov, A.A.: Lower Bounds on the Monotone Complexity of some Boolean Functions. Dokl. Akad. Nauk SSSR\u00a0281(4), 798\u2013801 (1985) (in Russian); English translation in: Soviet Math. Dokl.\u00a031, 354\u2013357 (1985)","key":"29_CR20"},{"doi-asserted-by":"crossref","unstructured":"Razborov, A.A.: A Lower Bound on the Monotone Network Complexity of the Logical Permanent. Mat. Zametki\u00a037(6), 887\u2013900 (1985) (in Russian); English translation in: Math. Notes\u00a037(6), 485\u2013493 (1985)","key":"29_CR21","DOI":"10.1007\/BF01157687"},{"issue":"3","key":"29_CR22","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1145\/146637.146684","volume":"39","author":"R. Raz","year":"1992","unstructured":"Raz, R., Wigderson, A.: Monotone Circuits for Matching require Linear Depth. JACM\u00a039(3), 736\u2013744 (1992)","journal-title":"JACM"},{"doi-asserted-by":"crossref","unstructured":"Raz, R., McKenzie, P.: Separation of the Monotone NC Hierarchy. In: 38th IEEE FOCS, pp. 234\u2013243 (1997)","key":"29_CR23","DOI":"10.1109\/SFCS.1997.646112"},{"doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic Methods in the theory of Lower Bounds for Boolean Circuit Complexity. In: 19th STOC, pp. 77\u201382 (1987)","key":"29_CR24","DOI":"10.1145\/28395.28404"},{"issue":"1","key":"29_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF02122563","volume":"8","author":"\u00c9. Tardos","year":"1988","unstructured":"Tardos, \u00c9.: The gap between Monotone and Non-monotone Circuit Complexity is Exponential. Combinatorica\u00a08(1), 141\u2013142 (1988)","journal-title":"Combinatorica"},{"unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner Series in Computer Science. Teubner, Stuttgart\/wiley, Chichester (1987)","key":"29_CR26"},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-08353-7_135","volume-title":"Mathematical Foundations of Computer Science 1977","author":"L. Valiant","year":"1977","unstructured":"Valiant, L.: Graph-Theoretical Methods in Low-level Complexity. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol.\u00a053, pp. 162\u2013176. Springer, Heidelberg (1977)"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.: Some Complexity Questions related to Distributive Computing. In: 11th ACM STOC, pp. 209\u2013213 (1979)","key":"29_CR28","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49382-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:54:14Z","timestamp":1740840854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49382-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653844","9783540493822"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}