{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:55:26Z","timestamp":1742972126675,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587462"},{"type":"electronic","value":"9783319587479"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58747-9_24","type":"book-chapter","created":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T01:14:05Z","timestamp":1493946845000},"page":"273-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The (Minimum) Rank of Typical Fooling-Set Matrices"],"prefix":"10.1007","author":[{"given":"Mozhgan","family":"Pourmoradnasseri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk Oliver","family":"Theis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,6]]},"reference":[{"issue":"2","key":"24_CR1","first-page":"127","volume":"3","author":"LB Beasley","year":"2013","unstructured":"Beasley, L.B., Klauck, H., Lee, T., Theis, D.O.: Communication complexity, linear optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). Dagstuhl Rep. 3(2), 127\u2013143 (2013)","journal-title":"Dagstuhl Rep."},{"key":"24_CR2","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, 2nd edn., vol. 73. Cambridge University Press, Cambridge (2001)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Hromkovi\u010d, J., Schnitger, G.: A comparison of two lower-bound methods for communication complexity. Theoret. Comput. Sci. 168(1), 39\u201351 (1996). 19th International Symposium on Mathematical Foundations of Computer Science (Ko\u0161ice, 1994)","DOI":"10.1016\/S0304-3975(96)00062-X"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.disc.2012.09.015","volume":"313","author":"S Fiorini","year":"2013","unstructured":"Fiorini, S., Kaibel, V., Pashkovich, K., Theis, D.O.: Combinatorial bounds on nonnegative rank and extended formulations. Discrete Math. 313(1), 67\u201383 (2013)","journal-title":"Discrete Math."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ejc.2015.02.016","volume":"48","author":"M Friesen","year":"2015","unstructured":"Friesen, M., Hamed, A., Lee, T., Theis, D.O.: Fooling-sets and rank. Eur. J. Comb. 48, 143\u2013153 (2015)","journal-title":"Eur. J. Comb."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Friesen, M., Theis, D.O.: Fooling-sets and rank in nonzero characteristic. In: Ne\u0161et\u0159il, J., Pellegrini, M. (eds.) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM series, vol.16, pp. 383\u2013390. CRM (2013)","DOI":"10.1007\/978-88-7642-475-5_61"},{"key":"24_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"A Frieze","year":"2015","unstructured":"Frieze, A., Karo\u0144ski, M.: Introduction to Random Graphs. Cambridge University Press, Cambridge (2015)"},{"key":"24_CR8","unstructured":"Golovnev, A., Regev, O., Weinstein, O.: The minrank of random graphs. Preprint arXiv:1607.04842 (2016)"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.laa.2010.01.036","volume":"433","author":"T Tracy Hall","year":"2010","unstructured":"Tracy Hall, T., Hogben, L., Martin, R., Shader, B.: Expected values of parameters associated with the minimum rank of a graph. Linear Algebra Appl. 433(1), 101\u2013117 (2010)","journal-title":"Linear Algebra Appl."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Haviv, I., Langberg, M.: On linear index coding for random graphs. In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2231\u20132235. IEEE (2012)","DOI":"10.1109\/ISIT.2012.6283850"},{"key":"24_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Rucinski, A.: Random Graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000)"},{"key":"24_CR12","unstructured":"Klauck, H., de Wolf, R.: Fooling one-sided quantum protocols. In: 30th International Symposium on Theoretical Aspects of Computer Science (2013)"},{"key":"24_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1080\/03081087.2015.1034642","volume":"64","author":"S Mallik","year":"2016","unstructured":"Mallik, S., Shader, B.L.: On graphs of minimum skew rank 4. Linear Multilinear Algebra 64(2), 279\u2013289 (2016)","journal-title":"Linear Multilinear Algebra"},{"issue":"3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1090\/S0894-0347-01-00367-8","volume":"14","author":"L R\u00f3nyai","year":"2001","unstructured":"R\u00f3nyai, L., Babai, L., Ganapathy, M.: On the number of zero-patterns of a sequence of polynomials. J. Am. Math. Soc. 14(3), 717\u2013735 (2001)","journal-title":"J. Am. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58747-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:16:50Z","timestamp":1710263810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58747-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587462","9783319587479"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58747-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"6 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kazan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/logic.pdmi.ras.ru\/csr2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}