{"id":"https://openalex.org/W1533624370","doi":"https://doi.org/10.1145/2876505","title":"Tight Lower Bound for the Channel Assignment Problem","display_name":"Tight Lower Bound for the Channel Assignment Problem","publication_year":2016,"publication_date":"2016-09-02","ids":{"openalex":"https://openalex.org/W1533624370","doi":"https://doi.org/10.1145/2876505","mag":"1533624370"},"language":"en","primary_location":{"id":"doi:10.1145/2876505","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2876505","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073398305","display_name":"Arkadiusz Soca\u0142a","orcid":null},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Arkadiusz Soca\u0142a","raw_affiliation_strings":["University of Warsaw, Poland","University of Warsaw , Poland"],"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073398305"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.00292578,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"4","first_page":"1","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/combinatorics","display_name":"Combinatorics","score":0.7389116287231445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6555935740470886},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6421592235565186},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.627841591835022},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.6119548082351685},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5733963847160339},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5335334539413452},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5178309082984924},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4959052503108978},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45929092168807983},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.4306493401527405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16965505480766296}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7389116287231445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6555935740470886},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6421592235565186},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.627841591835022},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.6119548082351685},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5733963847160339},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5335334539413452},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5178309082984924},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4959052503108978},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45929092168807983},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.4306493401527405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16965505480766296},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2876505","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2876505","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G216536116","display_name":null,"funder_award_id":"UMO-2013/09/B/ST6/03136","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1515598460","https://openalex.org/W1770176175","https://openalex.org/W1787126581","https://openalex.org/W1953176910","https://openalex.org/W1995725694","https://openalex.org/W2074359677","https://openalex.org/W2087638517","https://openalex.org/W2154475159","https://openalex.org/W2159011960","https://openalex.org/W2561675875","https://openalex.org/W2949110742","https://openalex.org/W2963923487"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W3095925971","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857"],"abstract_inverted_index":{"We":[0,55],"study":[1],"the":[2,5,31,42,50,53,60,67,86,97,104,132],"complexity":[3],"of":[4,41,49],"C":[6,16,92],"hannel":[7,17,93],"A":[8,18,94],"ssignment":[9,19,95],"problem.":[10],"An":[11],"open":[12],"problem":[13],"asks":[14],"whether":[15],"admits":[20],"an":[21],"O":[22,112,118,133],"(":[23,77,119],"c":[24,47],"n":[25,37,78,80,114,120,122],")":[26,81,123],"(times":[27,82],"a":[28,39,45,83],"polynomial":[29,84,137],"in":[30,59,66,85,110],"bit":[32,87],"size)":[33,88],"time":[34,89,99,111],"algorithm,":[35],"where":[36],"is":[38,73,129],"number":[40],"vertices,":[43],"for":[44],"constant":[46],"independent":[48],"weights":[51],"on":[52],"edges.":[54],"answer":[56],"this":[57],"question":[58],"negative.":[61],"Indeed,":[62],"we":[63],"show":[64],"that":[65,103],"standard":[68],"Word":[69],"RAM":[70],"model,":[71],"there":[72],"no":[74],"2":[75,117],"o":[76],"log":[79,121],"algorithm":[90,108],"solving":[91],"unless":[96],"exponential":[98],"hypothesis":[100],"fails.":[101],"Note":[102],"currently":[105],"best":[106],"known":[107],"works":[109],"*(":[113],"!)":[115],"=":[116],",":[124],"so":[125],"our":[126],"lower":[127],"bound":[128],"tight":[130],"(where":[131],"*()":[134],"notation":[135],"suppresses":[136],"factors).":[138]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}