{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T23:09:47Z","timestamp":1787872187741,"version":"build-2784847793"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_7","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"62-71","source":"Crossref","is-referenced-by-count":9,"title":["Lower Bounds on Matrix Rigidity Via a Quantum Argument"],"prefix":"10.1007","author":[{"given":"Ronald","family":"de Wolf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7_CR1","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-theoretic arguments in low-level complexity. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol.\u00a053, pp. 162\u2013176. Springer, Heidelberg (1977)"},{"key":"7_CR2","unstructured":"Alon, N.: On the rigidity of an Hadamard matrix. In: His proof may be found in [22, Section\u00a015.1.2] (1990)"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jcss.2001.1786","volume":"63","author":"S. Lokam","year":"2001","unstructured":"Lokam, S.: Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity. Journal of Computer and Systems Sciences\u00a063(3), 449\u2013473 (2001): Earlier version in FOCS 1995","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"4","key":"7_CR4","doi-asserted-by":"crossref","first-page":"535","DOI":"10.4213\/mzm1314","volume":"63","author":"B. Kashin","year":"1998","unstructured":"Kashin, B., Razborov, A.: Improved lower bounds on the rigidity of Hadamard matrices. Matematicheskie Zametki\u00a063(4), 535\u2013540 (1998) (in Russian): English translation available at Razborov\u2019s homepage","journal-title":"Matematicheskie Zametki"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01303207","volume":"13","author":"J. Friedman","year":"1993","unstructured":"Friedman, J.: A note on matrix rigidity. Combinatorica\u00a013(2), 235\u2013239 (1993)","journal-title":"Combinatorica"},{"issue":"6","key":"7_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0020-0190(97)00190-7","volume":"64","author":"M.A. Shokrollahi","year":"1997","unstructured":"Shokrollahi, M.A., Spielman, D., Stemann, V.: A remark on matrix rigidity. Information Processing Letters\u00a064(6), 283\u2013285 (1997)","journal-title":"Information Processing Letters"},{"issue":"1\u20132","key":"7_CR7","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0304-3975(00)00008-6","volume":"237","author":"S. Lokam","year":"2000","unstructured":"Lokam, S.: On the rigidity of Vandermonde matrices. Theoretical Computer Science\u00a0237(1\u20132), 477\u2013483 (2000)","journal-title":"Theoretical Computer Science"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Lokam, S.: A quadratic lower bound on rigidity (April 2005) (Manuscript)","DOI":"10.1007\/11750321_28"},{"key":"7_CR9","unstructured":"Lickteig, T.: Ein elementarer Beweis f\u00fcr eine geometrische Gradschanke f\u00fcr die Zahl der Operationen bei der Berechnung von Polynomen. Master\u2019s thesis, Diplomarbeit, Univ.\u00a0Konstanz (1980)"},{"key":"7_CR10","series-title":"Grundlehren der mathematischen Wissenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, vol.\u00a0315. Springer, Heidelberg (1997)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proceedings of 40th IEEE FOCS, pp. 369\u2013376 (1999) quant-ph\/9904093","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-49208-9_4","volume-title":"Quantum Computing and Quantum Communications","author":"R. Cleve","year":"1999","unstructured":"Cleve, R., Dam, W., van, N.M., Tapp, A.: Quantum entanglement and the communication complexity of the inner product function. In: Williams, C.P. (ed.) QCQC 1998. LNCS, vol.\u00a01509, pp. 61\u201374. Springer, Heidelberg (1999)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Kerenidis, I., De Wolf, R.: Exponential lower bound for 2-query locally decodable codes via a quantum argument. Proceedings of 35th ACM STOC, 106\u2013115 (2003) quant-ph\/0208062","DOI":"10.1145\/780559.780560"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1007\/11523468_115","volume-title":"Automata, Languages and Programming","author":"S. Wehner","year":"2005","unstructured":"Wehner, S., de Wolf, R.: Improved lower bounds for locally decodable codes and private information retrieval. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1424\u20131436. Springer, Heidelberg (2005)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Regev, O.: A lattice problem in quantum NP. Proceedings of 44th IEEE FOCS, 210\u2013219 (2003) quant-ph\/0307220","DOI":"10.1109\/SFCS.2003.1238195"},{"key":"7_CR16","unstructured":"Aharonov, D., Regev, O.: Lattice problems in NP\u2229coNP. In: Proceedings of 45th IEEE FOCS, pp. 362\u2013371 (2004)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Lower bounds for local search by quantum arguments. In: Proceedings of 35th ACM STOC, pp. 465\u2013474 (2003) quant-ph\/0307149","DOI":"10.1145\/1007352.1007358"},{"key":"7_CR18","unstructured":"Aaronson, S.: Quantum computing, postselection, and probabilistic polynomial-time (December 23, 2004) quant-ph\/0412187"},{"key":"7_CR19","unstructured":"Laplante, S., Lee, T., Szegedy, M.: The quantum adversary method and classical formula size lower bounds. In: Proceedings of 20th IEEE Conference on Computational Complexity (2005) quant-ph\/0501057"},{"key":"7_CR20","unstructured":"Kerenidis, I.: Quantum multiparty communication complexity and circuit lower bounds (April 12, 2005) quant-ph\/0504087"},{"key":"7_CR21","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"7_CR22","unstructured":"Midrijanis, G.: Three lines proof of the lower bound for the matrix rigidity (20 June 2005) cs.CC\/0506081"},{"key":"7_CR23","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley-Interscience, Chichester (2000)","edition":"2"},{"key":"7_CR24","series-title":"EATCS Series","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics. EATCS Series. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T16:15:25Z","timestamp":1736439325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11786986_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}