{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:14Z","timestamp":1758586214247,"version":"3.44.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_27","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:41Z","timestamp":1758498341000},"page":"362-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Study of\u00a0the\u00a0Binary and\u00a0Boolean Rank of\u00a0Matrices with\u00a0Small Constant Real Rank"],"prefix":"10.1007","author":[{"given":"Michal","family":"Parnas","sequence":"first","affiliation":[]},{"given":"Adi","family":"Shraibman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"issue":"9","key":"27_CR1","doi-asserted-by":"publisher","first-page":"3469","DOI":"10.1016\/j.laa.2011.12.013","volume":"436","author":"LB Beasley","year":"2012","unstructured":"Beasley, L.B.: Isolation number versus Boolean rank. Linear Algebra Appl. 436(9), 3469\u20133474 (2012)","journal-title":"Linear Algebra Appl."},{"key":"27_CR2","first-page":"47","volume":"011","author":"D de Caen","year":"1992","unstructured":"de Caen, D., Gregory, D., Henson, T., Lundgren, R., John, M.: Real rank as a bound for nonnegative integer rank. J. Comb. Math. Comb. Comput. 011, 47\u201353 (1992)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"27_CR3","unstructured":"de\u00a0Caen, D., Gregory, D.A., Pullman, N.J.: The Boolean rank of zero-one matrices. In: Proceedings of the 3rd Caribbean Conference on Combinatorics and Computing, pp. 169\u2013173 (1981)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Heydrich, S., Holm, E., Karrenbauer, A.: Nearly tight approximability results for minimum biclique cover and partition. In: European Symposium on Algorithms, pp. 235\u2013246. Springer (2014)","DOI":"10.1007\/978-3-662-44777-2_20"},{"key":"27_CR5","unstructured":"Chandran, S., Issac, D., Karrenbauer, A.: On the parameterized complexity of biclique cover and partition. In: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(96)00062-X","volume":"168","author":"M Dietzfelbinger","year":"1996","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)","journal-title":"Theoret. Comput. Sci."},{"issue":"21\u201323","key":"27_CR7","doi-asserted-by":"publisher","first-page":"2045","DOI":"10.1016\/j.tcs.2008.12.059","volume":"410","author":"H Fleischner","year":"2009","unstructured":"Fleischner, H., Mujuni, E., Paulusma, D., Szeider, S.: Covering graphs with few complete bipartite subgraphs. Theoret. Comput. Sci. 410(21\u201323), 2045\u20132053 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR8","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":"27_CR9","first-page":"2","volume":"13","author":"J Gramm","year":"2009","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. J. Exp. Algorithmics (JEA) 13, 2\u20132 (2009)","journal-title":"J. Exp. Algorithmics (JEA)"},{"issue":"3","key":"27_CR10","first-page":"223","volume":"8","author":"DA Gregory","year":"1983","unstructured":"Gregory, D.A., Pullman, N.J.: Semiring rank: Boolean rank and nonnegative rank factorization. J. Combin. Inform. System Sci. 8(3), 223\u2013233 (1983)","journal-title":"J. Combin. Inform. System Sci."},{"issue":"1","key":"27_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(91)90006-6","volume":"51","author":"DA Gregory","year":"1991","unstructured":"Gregory, D.A., Pullman, N.J., Jones, K.F., Lundgren, J.R.: Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices. J. Comb. Theory, Ser. B 51(1), 73\u201389 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.laa.2022.10.006","volume":"656","author":"I Haviv","year":"2023","unstructured":"Haviv, I., Parnas, M.: The binary rank of circulant block matrices. Linear Algebra Appl. 656, 277\u2013303 (2023)","journal-title":"Linear Algebra Appl."},{"key":"27_CR13","unstructured":"Hrube\u0161, P.: Hard submatrices for non-negative rank and communication complexity. In: 39th Computational Complexity Conference (CCC). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0300, pp. 1\u201312. Dagstuhl, Germany (2024)"},{"issue":"6","key":"27_CR14","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Saks, M.E.: Lattices, M\u00f6bius functions and communication complexity. In: IEEE 29th Annual Symposium on Foundations of Computer Science (FOCS), pp. 81\u201390 (1988)","DOI":"10.1109\/SFCS.1988.21924"},{"key":"27_CR16","unstructured":"Lovett, S.: Recent advances on the log-rank conjecture in communication complexity. Bull. EATCS 112 (2014)"},{"issue":"5","key":"27_CR17","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"80","author":"J Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indag. Math. 80(5), 406\u2013424 (1977)","journal-title":"Indag. Math."},{"key":"27_CR18","unstructured":"Parnas, M., Shraibman, A.: A study of the binary and Boolean rank of matrices with small constant real rank (2025). https:\/\/arxiv.org\/abs\/2507.05824"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.dam.2014.10.029","volume":"184","author":"M Shigeta","year":"2015","unstructured":"Shigeta, M., Amano, K.: Ordered biclique partitions and communication complexity problems. Discret. Appl. Math. 184, 248\u2013252 (2015)","journal-title":"Discret. Appl. Math."},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.jcta.2013.10.004","volume":"122","author":"Y Shitov","year":"2014","unstructured":"Shitov, Y.: An upper bound for nonnegative rank. J. Comb. Theory, Ser. A 122, 126\u2013132 (2014)","journal-title":"J. Comb. Theory, Ser. A"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:43Z","timestamp":1758498343000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}