{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:06Z","timestamp":1725516786608},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_10","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"92-99","source":"Crossref","is-referenced-by-count":1,"title":["Smallest Formulas for Parity of 2 k Variables Are Essentially Unique"],"prefix":"10.1007","author":[{"given":"Jun","family":"Tarui","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539794261556","volume":"27","author":"J. H\u00e5stad","year":"1998","unstructured":"H\u00e5stad, J.: The Shrinkage Exponent of De Morgan Formulae is\u00a02. SIAM Journal on Computing\u00a027(1), 48\u201364 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10_CR2","first-page":"83","volume":"10","author":"V.M. Khrapchenko","year":"1971","unstructured":"Khrapchenko, V.M.: A Method of Determining Lower Bounds for the Complexity of \u03a0-Schemes. Mat.Zametski\u00a010(1), 83\u201392 (1971) (in Russian); English translation in: Math. Notes 10(1), 474\u2013479 (1971)","journal-title":"Mat.Zametski"},{"issue":"2","key":"10_CR3","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 Super-Logarithmic Depth. SIAM J. Discrete Mathematics\u00a03(2), 255\u2013265 (1990)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"10_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1948.001.0001","volume-title":"Communication Complexity: A New Approach to Circuit Depth","author":"M. Karchmer","year":"1989","unstructured":"Karchmer, M.: Communication Complexity: A New Approach to Circuit Depth. MIT Press, Cambridge (1989)"},{"key":"10_CR5","volume-title":"Handbook of Theoretical Computer Science volume A, Algorithms and Complexity","author":"R. Boppana","year":"1990","unstructured":"Boppana, R., Sipser, M.: The Complexity of Finite Functions. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science volume A, Algorithms and Complexity. MIT Press, Cambridge (1990)"},{"key":"10_CR6","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge Univ. Press, Cambridge (1997)"},{"key":"10_CR7","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley, Chichester (1987) (on-line copy available at the web site of ECCC under Monographs)"},{"key":"10_CR8","unstructured":"Arora, S., Barak, B.: Complexity Theory: A Modern Approach (to be published, 2008)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(91)90191-J","volume":"37","author":"U. Zwick","year":"1991","unstructured":"Zwick, U.: An Extension of Khrapchenko\u2019s Theorem. Information Processing Letters\u00a037, 215\u2013217 (1991)","journal-title":"Information Processing Letters"},{"key":"10_CR10","first-page":"399","volume":"116","author":"E. Koutsoupias","year":"1993","unstructured":"Koutsoupias, E.: Improvements on Khraphchenko\u2019s Theorem. Information Processing Letters\u00a0116, 399\u2013403 (1993)","journal-title":"Information Processing Letters"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00037-006-0212-7","volume":"15","author":"S. Laplante","year":"2006","unstructured":"Laplante, S., Lee, T., Szegedy, M.: The Quantum Adversary Method and Classical Formula Size Lower Bounds. Computational Complexity\u00a015(2), 163\u2013196 (2006)","journal-title":"Computational Complexity"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/B978-0-12-417750-5.50008-7","volume-title":"Theory of Machines and Computations","author":"A. Borodin","year":"1971","unstructured":"Borodin, A.: Horner\u2019s Rule is Uniquely Optimal. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 45\u201358. Academic Press, London (1971)"},{"key":"10_CR13","series-title":"Seminumerical Algorithms","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1997","unstructured":"Knuth, D.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol.\u00a02. Addison-Wesley, Reading (1997)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:02:11Z","timestamp":1605762131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}