{"id":"https://openalex.org/W4399522745","doi":"https://doi.org/10.1145/3618260.3649620","title":"A Stronger Connection between the Asymptotic Rank Conjecture and the Set Cover Conjecture","display_name":"A Stronger Connection between the Asymptotic Rank Conjecture and the Set Cover Conjecture","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399522745","doi":"https://doi.org/10.1145/3618260.3649620"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649620","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649620","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649620","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649620","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087298778","display_name":"Kevin Pratt","orcid":"https://orcid.org/0000-0002-2923-0905"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kevin Pratt","raw_affiliation_strings":["New York University, New York, USA"],"affiliations":[{"raw_affiliation_string":"New York University, New York, USA","institution_ids":["https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087298778"],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":1.1385,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7930354,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"871","last_page":"874"},"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.9976999759674072,"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.9976999759674072,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9965999722480774,"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/T12303","display_name":"Tensor decomposition and applications","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.8612798452377319},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.755386471748352},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.7252664566040039},{"id":"https://openalex.org/keywords/strassen-algorithm","display_name":"Strassen algorithm","score":0.6884941458702087},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6865053176879883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6775869131088257},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5018401145935059},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4788353741168976},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44812437891960144},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43974900245666504},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4111884534358978},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11395907402038574},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.062489062547683716},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0586281418800354},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05616968870162964}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.8612798452377319},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.755386471748352},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7252664566040039},{"id":"https://openalex.org/C39096654","wikidata":"https://www.wikidata.org/wiki/Q728507","display_name":"Strassen algorithm","level":4,"score":0.6884941458702087},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6865053176879883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6775869131088257},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5018401145935059},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4788353741168976},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44812437891960144},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43974900245666504},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4111884534358978},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11395907402038574},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.062489062547683716},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0586281418800354},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05616968870162964},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649620","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649620","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649620","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649620","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649620","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649620","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4399522745.pdf"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W107528361","https://openalex.org/W135913015","https://openalex.org/W1994289991","https://openalex.org/W2080063509","https://openalex.org/W2153063335","https://openalex.org/W2404960361","https://openalex.org/W4399521565","https://openalex.org/W6605517240"],"related_works":["https://openalex.org/W4303646773","https://openalex.org/W2069906535","https://openalex.org/W2950769433","https://openalex.org/W2561887839","https://openalex.org/W1964529245","https://openalex.org/W2041189380","https://openalex.org/W3119520783","https://openalex.org/W2738778419","https://openalex.org/W2951225764","https://openalex.org/W4225742872"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,19,28,42,74,97],"short":[3],"proof":[4],"that":[5,11,49,55,67,73],"Strassen\u2019s":[6,50],"asymptotic":[7,51,87],"rank":[8,52,88,106],"conjecture":[9,53,59,71,120],"implies":[10,54,72],"for":[12,24,113],"every":[13],"\u03b5":[14],">":[15],"0":[16],"there":[17],"exists":[18],"(3/22/3":[20],"+":[21],"\u03b5)n-time":[22],"algorithm":[23],"set":[25,57,69,118],"cover":[26,58,70,119],"on":[27,103],"universe":[29],"of":[30,35,45,77,101,107],"size":[31],"n":[32],"with":[33],"sets":[34],"bounded":[36],"size.":[37],"This":[38],"strengthens":[39],"and":[40,47],"simplifies":[41],"recent":[43],"result":[44],"Bj'orklund":[46],"Kaski":[48],"the":[56,68,104,117],"is":[60,121],"false.":[61,122],"From":[62],"another":[63],"perspective,":[64],"we":[65],"show":[66],"particular":[75],"family":[76],"tensors":[78],"Tn":[79,108],"\u2208":[80],"\u2102N":[81,83,85],"\u2297":[82,84],"has":[86],"greater":[89],"than":[90],"N1.08.":[91],"Furthermore,":[92],"if":[93],"one":[94],"could":[95],"improve":[96],"known":[98],"upper":[99],"bound":[100],"8n":[102],"tensor":[105],"to":[109],"2/9":[110],"\u00b7":[111],"n8n":[112],"any":[114],"n,":[115],"then":[116]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}