{"id":"https://openalex.org/W4413164607","doi":"https://doi.org/10.1007/s00037-025-00269-4","title":"Hard submatrices for non-negative rank and communication complexity","display_name":"Hard submatrices for non-negative rank and communication complexity","publication_year":2025,"publication_date":"2025-08-13","ids":{"openalex":"https://openalex.org/W4413164607","doi":"https://doi.org/10.1007/s00037-025-00269-4"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-025-00269-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-025-00269-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00269-4.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00269-4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103278473","display_name":"Pavel Hrube\u0161","orcid":"https://orcid.org/0000-0003-4526-4934"},"institutions":[{"id":"https://openalex.org/I4210147863","display_name":"Czech Academy of Sciences, Institute of Atmospheric Physics","ror":"https://ror.org/04vtzcr32","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210147863"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Pavel Hrube\u0161","raw_affiliation_strings":["Institute of Mathematics of ASCR, Prague, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics of ASCR, Prague, Czechia","institution_ids":["https://openalex.org/I4210147863"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103278473"],"corresponding_institution_ids":["https://openalex.org/I4210147863"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20350171,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6375340223312378},{"id":"https://openalex.org/keywords/block-matrix","display_name":"Block matrix","score":0.5879759192466736},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5364698767662048},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5128507614135742},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47295281291007996},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4578479826450348},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.453479528427124},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4271535277366638},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41773998737335205},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34010839462280273},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26062241196632385},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1666944921016693},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.15127778053283691}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6375340223312378},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.5879759192466736},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5364698767662048},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5128507614135742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47295281291007996},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4578479826450348},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.453479528427124},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4271535277366638},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41773998737335205},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34010839462280273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26062241196632385},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1666944921016693},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.15127778053283691},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00037-025-00269-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-025-00269-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00269-4.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00037-025-00269-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-025-00269-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-025-00269-4.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413164607.pdf","grobid_xml":"https://content.openalex.org/works/W4413164607.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W605043455","https://openalex.org/W1979397185","https://openalex.org/W2020551595","https://openalex.org/W2061987651","https://openalex.org/W2119368733","https://openalex.org/W2145501841","https://openalex.org/W2150285483","https://openalex.org/W2159584454","https://openalex.org/W2160403361","https://openalex.org/W2290482318","https://openalex.org/W2929022037","https://openalex.org/W3034864005","https://openalex.org/W3044232313","https://openalex.org/W3165098550","https://openalex.org/W4211154544","https://openalex.org/W4238781763","https://openalex.org/W4255213956","https://openalex.org/W4399520896","https://openalex.org/W7074602875"],"related_works":["https://openalex.org/W580815825","https://openalex.org/W2498430702","https://openalex.org/W2061410220","https://openalex.org/W2112835755","https://openalex.org/W4291951920","https://openalex.org/W2349674371","https://openalex.org/W2964207886","https://openalex.org/W3099618697","https://openalex.org/W2365701604","https://openalex.org/W1972759654"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"a":[2,20,43,66,112],"non-negative":[3,8,61,77],"real":[4],"matrix":[5,59,114],"M":[6,24],"of":[7,23,60,111,125,136],"rank":[9,62,78],"at":[10,69,79],"least":[11,80],"r":[12,63,71],",":[13],"can":[14],"we":[15,39],"witness":[16],"this":[17,34],"fact":[18],"by":[19],"small":[21],"submatrix":[22,67],"?":[25],"While":[26],"Moitra":[27],"(SIAM":[28],"J.":[29],"Comput.":[30],"2013)":[31],"proved":[32,106],"that":[33,41],"cannot":[35],"be":[36],"achieved":[37],"exactly,":[38],"show":[40],"such":[42],"witnessing":[44],"is":[45,105,129],"possible":[46],"approximately:":[47],"An":[48],"$$m\\times":[49],"n$$":[50],"<mml:math":[51,84],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[52,85],"<mml:mrow>":[53,86,91],"<mml:mi>m</mml:mi>":[54,95],"<mml:mo>\u00d7</mml:mo>":[55],"<mml:mi>n</mml:mi>":[56,93],"</mml:mrow>":[57,96,99],"</mml:math>":[58,100],"always":[64],"contains":[65],"with":[68,76],"most":[70],"3":[72],"rows":[73],"and":[74,138],"columns":[75],"$$\\Omega(\\frac{r}{\\log":[81],"n\\log":[82],"m})$$":[83],"<mml:mi>\u03a9</mml:mi>":[87],"<mml:mo>(</mml:mo>":[88],"<mml:mfrac>":[89],"<mml:mi>r</mml:mi>":[90],"<mml:mo>log</mml:mo>":[92,94],"</mml:mfrac>":[97],"<mml:mo>)</mml:mo>":[98],".":[101],"A":[102],"similar":[103],"result":[104],"for":[107,118],"the":[108,126,133],"1-partition":[109],"number":[110],"Boolean":[113],"and,":[115],"consequently,":[116],"also":[117],"its":[119],"two-player":[120],"deterministic":[121],"communication":[122],"complexity.":[123],"Tightness":[124],"latter":[127],"estimate":[128],"closely":[130],"related":[131],"to":[132],"log-rank":[134],"conjecture":[135],"Lov\u00e1sz":[137],"Saks.":[139]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}