{"id":"https://openalex.org/W4399521565","doi":"https://doi.org/10.1145/3618260.3649656","title":"The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True","display_name":"The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399521565","doi":"https://doi.org/10.1145/3618260.3649656"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649656","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649656","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649656","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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649656","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038787166","display_name":"Andreas Bj\u00f6rklund","orcid":"https://orcid.org/0009-0009-9303-9986"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Andreas Bj\u00f6rklund","raw_affiliation_strings":["IT University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0009-0009-9303-9986","affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055721632","display_name":"Petteri Kaski","orcid":"https://orcid.org/0009-0002-3069-7753"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Petteri Kaski","raw_affiliation_strings":["Aalto University, Espoo, Finland"],"raw_orcid":"https://orcid.org/0009-0002-3069-7753","affiliations":[{"raw_affiliation_string":"Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4286,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.95767196,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"859","last_page":"870"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.8460124731063843},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6286708116531372},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5791414976119995},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5661815404891968},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.535358190536499},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49595603346824646},{"id":"https://openalex.org/keywords/collatz-conjecture","display_name":"Collatz conjecture","score":0.4267701804637909},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4080740213394165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3144398331642151},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07616984844207764}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.8460124731063843},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6286708116531372},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5791414976119995},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5661815404891968},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.535358190536499},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49595603346824646},{"id":"https://openalex.org/C128814272","wikidata":"https://www.wikidata.org/wiki/Q837314","display_name":"Collatz conjecture","level":3,"score":0.4267701804637909},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4080740213394165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3144398331642151},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07616984844207764},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3618260.3649656","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649656","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649656","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"},{"id":"pmh:oai:pure.atira.dk:openaire/4776ffe4-4b0f-41b1-a2a4-94ca5e086bcf","is_oa":true,"landing_page_url":"https://pure.itu.dk/portal/da/publications/4776ffe4-4b0f-41b1-a2a4-94ca5e086bcf","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bj\u00f6rklund, A & Kaski, P 2024, The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True. in STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. https://doi.org/10.1145/3618260.3649656","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/129699","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/89eebdad-8b17-420a-8518-bccccf8178f2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649656","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649656","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649656","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":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399521565.pdf"},"referenced_works_count":63,"referenced_works":["https://openalex.org/W135913015","https://openalex.org/W1497895992","https://openalex.org/W1561337879","https://openalex.org/W1565043606","https://openalex.org/W1565709240","https://openalex.org/W1599026900","https://openalex.org/W1691921959","https://openalex.org/W1747610753","https://openalex.org/W1953176910","https://openalex.org/W1968245619","https://openalex.org/W1979740015","https://openalex.org/W1981663184","https://openalex.org/W1982687611","https://openalex.org/W1985572324","https://openalex.org/W1988642505","https://openalex.org/W1996440503","https://openalex.org/W2001868457","https://openalex.org/W2015963099","https://openalex.org/W2023724794","https://openalex.org/W2035476608","https://openalex.org/W2038073775","https://openalex.org/W2045326192","https://openalex.org/W2050396298","https://openalex.org/W2052142033","https://openalex.org/W2057503509","https://openalex.org/W2074359677","https://openalex.org/W2076397052","https://openalex.org/W2080132708","https://openalex.org/W2096495231","https://openalex.org/W2102892751","https://openalex.org/W2120141762","https://openalex.org/W2120248756","https://openalex.org/W2126436716","https://openalex.org/W2180988813","https://openalex.org/W2404960361","https://openalex.org/W2608950249","https://openalex.org/W2610844084","https://openalex.org/W2619660439","https://openalex.org/W2794350243","https://openalex.org/W2796002431","https://openalex.org/W2903605276","https://openalex.org/W2914414140","https://openalex.org/W2941570035","https://openalex.org/W2951997246","https://openalex.org/W2963282263","https://openalex.org/W2963792447","https://openalex.org/W2966702489","https://openalex.org/W3006060740","https://openalex.org/W3016262848","https://openalex.org/W3019043336","https://openalex.org/W3035322289","https://openalex.org/W3116253690","https://openalex.org/W3120183386","https://openalex.org/W4200136360","https://openalex.org/W4205630623","https://openalex.org/W4205752437","https://openalex.org/W4212992501","https://openalex.org/W4229812932","https://openalex.org/W4231247888","https://openalex.org/W4252614677","https://openalex.org/W4281568021","https://openalex.org/W4376639554","https://openalex.org/W4386644492"],"related_works":["https://openalex.org/W4291209671","https://openalex.org/W2950288113","https://openalex.org/W1782528665","https://openalex.org/W2951225764","https://openalex.org/W2100234888","https://openalex.org/W1973978937","https://openalex.org/W2097887535","https://openalex.org/W2163633449","https://openalex.org/W4213178788","https://openalex.org/W4283323077"],"abstract_inverted_index":{"Strassen\u2019s":[0],"asymptotic":[1,198,273],"rank":[2,16,199,274],"conjecture":[3,139,200,207,283],"[Progr.":[4],"\u200dMath.":[5],"\u200d120":[6],"\u200d(1994)]":[7],"claims":[8],"a":[9,18,27,79,109,118,125,163,211,250,256,260,287],"strong":[10],"submultiplicative":[11],"upper":[12],"bound":[13],"on":[14],"the":[15,55,66,89,153,188,197,204,268,272,279,282],"of":[17,26,57,112,115,127,247,271,281],"three-tensor":[19],"obtained":[20],"as":[21,103,162],"an":[22,105,226],"iterated":[23],"Kronecker":[24],"product":[25],"constant-size":[28],"base":[29],"tensor.":[30,292],"The":[31,97,138],"conjecture,":[32,70],"if":[33,196],"true,":[34,202],"most":[35,129],"notably":[36],"would":[37,60,223],"put":[38],"square":[39],"matrix":[40],"multiplication":[41],"in":[42,54,93,132,166,219],"quadratic":[43],"time.":[44],"We":[45,193],"note":[46],"here":[47],"that":[48,73,85,195,246,278],"some":[49,231],"more-or-less":[50],"unexpected":[51],"algorithmic":[52],"results":[53,264],"area":[56],"exponential-time":[58],"algorithms":[59],"also":[61,224],"follow.":[62],"Specifically,":[63],"we":[64,222],"study":[65],"so-called":[67],"set":[68,205],"cover":[69,206],"which":[71,239],"states":[72],"for":[74,230,234,238,286],"any":[75],"\u0454>0":[76],"there":[77,123,183],"exists":[78],"positive":[80,119],"integer":[81,120],"constant":[82,232],"k":[83],"such":[84,241],"no":[86,240],"algorithm":[87,229,242],"solves":[88],"k-Set":[90,98],"Cover":[91,99],"problem":[92,100,237],"worst-case":[94],"time":[95],"((2\u2212\u0454)n|F|poly(n)).":[96],"asks,":[101],"given":[102,251],"input":[104],"n-element":[106],"universe":[107],"U,":[108,116],"family":[110],"F":[111,133],"size-at-most-k":[113],"subsets":[114],"and":[117,150,175,215],"t,":[121],"whether":[122,249],"is":[124,136,201,208,243],"subfamily":[126],"at":[128],"t":[130],"sets":[131],"whose":[134],"union":[135],"U.":[137],"was":[140,160],"formulated":[141],"by":[142,213],"Cygan,":[143,167],"Fomin,":[144],"Kowalik,":[145],"Lokshtanov,":[146,169],"Marx,":[147,170],"Pilipczuk,":[148,149],"Saurabh":[151],"\u200din":[152],"monograph":[154],"Parameterized":[155],"Algorithms":[156],"[Springer,":[157],"\u200d2015],":[158],"but":[159],"implicit":[161],"hypothesis":[164],"already":[165],"Dell,":[168],"Nederlof,":[171],"Okamoto,":[172],"Paturi,":[173],"Saurabh,":[174],"Wahlstr'om":[176],"\u200d[CCC":[177],"\u200d2012,":[178],"ACM":[179],"\u200dTrans.":[180],"\u200dAlgorithms":[181],"\u200d2016],":[182],"conjectured":[184],"to":[185],"follow":[186],"from":[187],"Strong":[189],"Exponential":[190],"Time":[191],"Hypothesis.":[192],"prove":[194],"then":[203],"false.":[209],"Using":[210],"reduction":[212],"Krauthgamer":[214],"Trabelsi":[216],"[STACS":[217],"\u200d2019],":[218],"this":[220],"scenario":[221],"get":[225],"((2\u2212\u03b4)n)-time":[227],"randomized":[228],"\u03b4>0":[233],"another":[235],"well-studied":[236],"known,":[244],"namely":[245],"deciding":[248],"n-vertex":[252],"directed":[253],"graph":[254],"has":[255],"Hamiltonian":[257],"cycle.":[258],"At":[259],"fine-grained":[261],"level,":[262],"our":[263],"do":[265],"not":[266],"need":[267],"full":[269],"strength":[270],"conjecture;":[275],"it":[276],"suffices":[277],"conclusion":[280],"holds":[284],"approximately":[285],"single":[288],"7\u00d7":[289,290],"7":[291]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}