{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T00:54:39Z","timestamp":1768352079746,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642382321","type":"print"},{"value":"9783642382338","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_25","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"300-311","source":"Crossref","is-referenced-by-count":5,"title":["Query Complexity of Matroids"],"prefix":"10.1007","author":[{"given":"Raghav","family":"Kulkarni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.jcss.2004.02.002","volume":"69","author":"H. Barnum","year":"2004","unstructured":"Barnum, H., Saks, M.E.: A lower bound on the quantum query complexity of read-once functions. J. Comput. Syst. Sci.\u00a069(2), 244\u2013258 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Beigel, R.: The Polynomial Method in Circuit Complexity. In: Structure in Complexity Theory Conference, pp. 82\u201395 (1993)","DOI":"10.1109\/SCT.1993.336538"},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1109\/12.755000","volume":"48","author":"A. Bernasconi","year":"1999","unstructured":"Bernasconi, A., Codenotti, B.: Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem. IEEE Trans. Computers\u00a048(3), 345\u2013351 (1999)","journal-title":"IEEE Trans. Computers"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rner, A.: Matroid Applications (ch. 7.). In: Homology and Shellability of Matroids and Geometric Lattices, pp. 226\u2013283 (1992)","DOI":"10.1017\/CBO9780511662041.008"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rner, A., Lov\u00e1sz, L., Yao, A.C.-C.: Linear Decision Trees: Volume Estimates and Topological Bounds. In: STOC 1992, pp. 170\u2013177 (1992)","DOI":"10.1145\/129712.129730"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Information. Contemporary Mathematics, vol.\u00a0305, pp. 53\u201374. AMS (2002)","DOI":"10.1090\/conm\/305\/05215"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Buhrman, H., de Wolf, R.: Communication Complexity Lower Bounds by Polynomials. In: IEEE Conference on Computational Complexity, pp. 120\u2013130 (2001)","DOI":"10.1109\/CCC.2001.933879"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci.\u00a0288(1), 21\u201343 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR9","unstructured":"Childs, A.M., Kothari, R.: Quantum query complexity of minor-closed graph properties. In: STACS 2011, pp. 661\u2013672 (2011)"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01844845","volume":"16","author":"C.R. Coullard","year":"1996","unstructured":"Coullard, C.R., Hellerstein, L.: Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory. Combinatorica\u00a016(2), 189\u2013208 (1996)","journal-title":"Combinatorica"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-02927-1_42","volume-title":"Automata, Languages and Programming","author":"P. Gopalan","year":"2009","unstructured":"Gopalan, P., O\u2019Donnell, R., Servedio, R.A., Shpilka, A., Wimmer, K.: Testing Fourier Dimensionality and Sparsity. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 500\u2013512. Springer, Heidelberg (2009)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Lov, K.,, G.: A Fast Quantum Mechanical Algorithm for Database Search. In: STOC 1996, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Matthews, W., Paturi, R.: A satisfiability algorithm for AC0. In: SODA 2012, pp. 961\u2013972 (2012)","DOI":"10.1137\/1.9781611973099.77"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Jain, R., Klauck, H.: The Partition Bound for Classical Communication Complexity and Query Complexity. In: IEEE Conference on Computational Complexity, pp. 247\u2013258 (2010)","DOI":"10.1109\/CCC.2010.31"},{"issue":"4","key":"25_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF02579140","volume":"4","author":"J. Kahn","year":"1984","unstructured":"Kahn, J., Saks, M.E., Sturtevant, D.: A topological approach to evasiveness. Combinatorica\u00a04(4), 297\u2013306 (1984)","journal-title":"Combinatorica"},{"issue":"4","key":"25_CR16","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF02711519","volume":"15","author":"P. Kleinschmidt","year":"1996","unstructured":"Kleinschmidt, P., Onn, S.: Signable Posets and Partitionable Simplicial Complexes. Discrete and Computational Geometry\u00a015(4), 443\u2013466 (1996)","journal-title":"Discrete and Computational Geometry"},{"issue":"1-3","key":"25_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.disc.2005.02.017","volume":"300","author":"W. Kook","year":"2005","unstructured":"Kook, W.: A new formula for an evaluation of the Tutte polynomial of a matroid. Discrete Mathematics\u00a0300(1-3), 235\u2013238 (2005)","journal-title":"Discrete Mathematics"},{"issue":"6","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevitz","year":"1993","unstructured":"Kushilevitz, E., Mansour, Y.: Learning Decision Trees Using the Fourier Spectrum. SIAM J. Comput.\u00a022(6), 1331\u20131348 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00037-010-0292-2","volume":"19","author":"N. Leonardos","year":"2010","unstructured":"Leonardos, N., Saks, M.: Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. Computational Complexity\u00a019(2), 153\u2013181 (2010)","journal-title":"Computational Complexity"},{"key":"25_CR20","unstructured":"Montanaro, A., Osborne, T.: On the communication complexity of XOR functions. CoRR abs\/0909.3392 (2009)"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01263419","volume":"4","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Szegedy, M.: On the Degree of Boolean Functions as Real Polynomials. Computational Complexity\u00a04, 301\u2013313 (1994)","journal-title":"Computational Complexity"},{"issue":"4","key":"25_CR22","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BF01192527","volume":"15","author":"N. Nisan","year":"1995","unstructured":"Nisan, N., Wigderson, A.: On Rank vs. Communication Complexity. Combinatorica\u00a015(4), 557\u2013565 (1995)","journal-title":"Combinatorica"},{"issue":"3","key":"25_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"R.L. Rivest","year":"1976","unstructured":"Rivest, R.L., Vuillemin, J.: On Recognizing Graph Properties from Adjacency Matrices. Theor. Comput. Sci.\u00a03(3), 371\u2013384 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR24","unstructured":"Shi, Y., Zhang, Z.: Communication Complexities of XOR functions CoRR abs\/0808.1762 (2008)"},{"issue":"5","key":"25_CR25","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"D.R. Simon","year":"1997","unstructured":"Simon, D.R.: On the Power of Quantum Computation. SIAM J. Comput.\u00a026(5), 1474\u20131483 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"25_CR26","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00493-006-0020-3","volume":"26","author":"B. Szegedy","year":"2006","unstructured":"Szegedy, B., Szegedy, C.: Symplectic Spaces And Ear-Decomposition Of Matroids. Combinatorica\u00a026(3), 353\u2013377 (2006)","journal-title":"Combinatorica"},{"issue":"26-28","key":"25_CR27","doi-asserted-by":"publisher","first-page":"2612","DOI":"10.1016\/j.tcs.2010.03.027","volume":"411","author":"Z. Zhang","year":"2010","unstructured":"Zhang, Z., Shi, Y.: On the parity complexity measures of Boolean functions. Theor. Comput. Sci.\u00a0411(26-28), 2612\u20132618 (2010)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:09:39Z","timestamp":1746007779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}