{"id":"https://openalex.org/W2907309485","doi":"https://doi.org/10.1137/17m1157957","title":"A Time Hierarchy Theorem for the LOCAL Model","display_name":"A Time Hierarchy Theorem for the LOCAL Model","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2907309485","doi":"https://doi.org/10.1137/17m1157957","mag":"2907309485"},"language":"en","primary_location":{"id":"doi:10.1137/17m1157957","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1157957","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5061847213","display_name":"Yi\u2010Jun Chang","orcid":"https://orcid.org/0000-0002-0109-2432"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi-Jun Chang","raw_affiliation_strings":["University of Michigan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076564426"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":5.2057,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.95915783,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"48","issue":"1","first_page":"33","last_page":"69"},"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.9998000264167786,"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.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematics","display_name":"Mathematics","score":0.7276134490966797},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6891908049583435},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5828597545623779},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5510292649269104},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4897167980670929},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4846830666065216},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4833073616027832},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47099846601486206},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4653298258781433},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3584063649177551},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16305097937583923}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7276134490966797},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6891908049583435},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5828597545623779},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5510292649269104},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4897167980670929},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4846830666065216},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4833073616027832},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47099846601486206},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4653298258781433},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3584063649177551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16305097937583923},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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.1137/17m1157957","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1157957","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4167357606","display_name":"AitF:Collaborative Research: Bridging the Gap between Theory and Practice for Matching and Edge Cover Problems","funder_award_id":"1637546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6809486582","display_name":null,"funder_award_id":"CCF-1637546","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8864822960","display_name":"AF:  Medium: Collaborative Research: Hardness in Polynomial Time","funder_award_id":"1514383","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8959633998","display_name":null,"funder_award_id":"CCF-1514383","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1957963525","https://openalex.org/W1970330908","https://openalex.org/W1989134823","https://openalex.org/W1999120866","https://openalex.org/W2011595776","https://openalex.org/W2017345786","https://openalex.org/W2054910423","https://openalex.org/W2062246109","https://openalex.org/W2067661972","https://openalex.org/W2109693504","https://openalex.org/W2110673270","https://openalex.org/W2125495920","https://openalex.org/W2138623498","https://openalex.org/W2160532428","https://openalex.org/W2198255326","https://openalex.org/W2467514673","https://openalex.org/W2552762966","https://openalex.org/W2626058046","https://openalex.org/W2949581528","https://openalex.org/W3103554207","https://openalex.org/W3104625252","https://openalex.org/W3122785907"],"related_works":["https://openalex.org/W4306705875","https://openalex.org/W2374778222","https://openalex.org/W2964041938","https://openalex.org/W2134409170","https://openalex.org/W2095393099","https://openalex.org/W2595921241","https://openalex.org/W2112243290","https://openalex.org/W1756533857","https://openalex.org/W1975020978","https://openalex.org/W2314909417"],"abstract_inverted_index":{"The":[0,19,161],"celebrated":[1],"time":[2,24,83,99,261,278],"hierarchy":[3,84,262],"theorem":[4,26,85,194],"for":[5,37,86,159,167,174,305,319,348,356],"Turing":[6],"machines":[7],"states,":[8],"informally,":[9],"that":[10,48,92,195,197,234,271,332],"more":[11,17],"problems":[12,51,116,321],"can":[13,56,124,205,279],"be":[14,57,125,206,280],"solved":[15],"given":[16],"time.":[18,307],"extent":[20],"to":[21,60,283],"which":[22],"a":[23,61,209,216,255],"hierarchy--type":[25],"holds":[27],"in":[28,52,96,243,258,276,285],"the":[29,53,81,87,97,130,140,149,152,203,244,259,288,291,301,329],"classic":[30],"distributed":[31,292],"$\\mathsf{LOCAL}$":[32,54,88,98,317],"model":[33,55,89],"has":[34],"been":[35],"open":[36],"many":[38],"years.":[39],"In":[40,76,298],"particular,":[41],"it":[42],"is":[43,157,303],"consistent":[44],"with":[45,215],"previous":[46,217],"results":[47,103],"all":[49],"natural":[50,240],"classified":[58],"according":[59],"small":[62],"constant":[63],"number":[64],"of":[65,113,132,142,151,227,290,315],"complexities,":[66],"such":[67],"as":[68,105],"$O(1),O(\\log^*":[69],"n),":[70,72],"O(\\log":[71],"2^{O(\\sqrt{\\log":[73],"n})}$,":[74],"etc.":[75],"this":[77,136,232],"paper":[78],"we":[79,309,341],"establish":[80],"first":[82],"and":[90,163,171,173,177,223,312,327,355,360],"prove":[91,190],"several":[93],"gaps":[94,331],"exist":[95],"hierarchy.":[100],"Our":[101],"main":[102],"are":[104,238,333],"follows:":[106],"(a)":[107],"We":[108,189,253],"define":[109],"an":[110,191,273,343,351,363],"infinite":[111],"set":[112],"simple":[114],"coloring":[115],"called":[117],"hierarchical":[118,154],"$2\\frac{1}{2}$-coloring.":[119],"A":[120],"correctly":[121],"colored":[122],"graph":[123],"confirmed":[126],"by":[127,336],"simply":[128],"checking":[129],"neighborhood":[131],"each":[133],"vertex,":[134],"so":[135],"problem":[137,156,184,275],"fits":[138],"into":[139,208],"class":[141],"locally":[143],"checkable":[144],"labeling":[145],"(LCL)":[146],"problems.":[147],"However,":[148],"complexity":[150,289,330,346,366],"$k$-level":[153],"$2\\frac{1}{2}$-coloring":[155],"$\\Theta(n^{1/k})$":[158],"$k\\in\\mathbb{Z}^+$.":[160],"upper":[162],"lower":[164],"bounds":[165],"hold":[166],"both":[168,175],"general":[169,264,361],"graphs":[170],"trees":[172,359],"randomized":[176,199,260,269],"deterministic":[178,210,241],"algorithms.":[179],"(b)":[180],"Consider":[181],"any":[182,198,268],"LCL":[183,204,274,320],"on":[185,235,263],"bounded":[186,357],"degree":[187,358],"trees.":[188],"automatic":[192],"speedup":[193],"states":[196],"$n^{o(1)}$-time":[200],"algorithm":[201,270],"solving":[202],"transformed":[207],"$O(\\log":[211],"n)$-time":[212],"algorithm.":[213],"Together":[214],"result":[218],"[Y.-J.":[219],"Chang,":[220],"T.":[221],"Kopelowitz,":[222],"S.":[224],"Pettie,":[225],"Proceedings":[226],"FOCS,":[228],"2016,":[229],"pp.":[230],"615--624],":[231],"establishes":[233],"trees,":[236],"there":[237],"no":[239],"complexities":[242],"ranges":[245],"$\\omega(\\log^*":[246],"n)$---$o(\\log":[247],"n)$":[248,345],"or":[249],"$\\omega(\\log":[250],"n)$---$n^{o(1)}$.":[251],"(c)":[252],"expose":[254],"new":[256],"gap":[257],"graphs.":[265],"Roughly":[266],"speaking,":[267],"solves":[272],"sublogarithmic":[277,306],"sped":[281],"up":[282],"run":[284],"$O(T_{LLL})$":[286],"time:":[287],"Lov\u00e1sz":[293],"local":[294],"lemma":[295],"(LLL)":[296],"problem.":[297],"other":[299],"words,":[300],"LLL":[302],"complete":[304],"Finally,":[308],"revisit":[310],"Naor":[311],"Stockmeyer's":[313],"characterization":[314],"$O(1)$-time":[316],"algorithms":[318],"(as":[322],"order-invariant":[323],"w.r.t.":[324],"vertex":[325],"IDs)":[326],"calculate":[328],"directly":[334],"implied":[335],"their":[337],"proof.":[338],"For":[339],"$n$-rings":[340],"see":[342],"$\\omega(1)$---$o(\\log^*":[344],"gap,":[347,354],"$(\\sqrt{n}\\times":[349],"\\sqrt{n})$-tori":[350],"$\\omega(1)$---$o(\\sqrt{\\log^*":[352],"n})$":[353],"graphs,":[362],"$\\omega(1)$---$o(\\log(\\log^*":[364],"n))$":[365],"gap.":[367]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":3}],"updated_date":"2026-07-14T08:27:34.040176","created_date":"2025-10-10T00:00:00"}