{"id":"https://openalex.org/W7125511276","doi":"https://doi.org/10.4230/lipics.itcs.2026.79","title":"Range Avoidance and Remote Point: New Algorithms and Hardness","display_name":"Range Avoidance and Remote Point: New Algorithms and Hardness","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7125511276","doi":"https://doi.org/10.4230/lipics.itcs.2026.79"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25366","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.79","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.79","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123679824","display_name":"Shengtang Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I126520041","display_name":"University of Science and Technology of China","ror":"https://ror.org/04c4dkn09","country_code":"CN","type":"education","lineage":["https://openalex.org/I126520041","https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huang, Shengtang","raw_affiliation_strings":["School of the Gifted Young, University of Science and Technology of China, Hefei, Anhui, China"],"raw_orcid":"https://orcid.org/0009-0006-7788-4424","affiliations":[{"raw_affiliation_string":"School of the Gifted Young, University of Science and Technology of China, Hefei, Anhui, China","institution_ids":["https://openalex.org/I126520041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123661731","display_name":"Xin Li","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Li, Xin","raw_affiliation_strings":["Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA"],"raw_orcid":"https://orcid.org/0000-0002-9408-2451","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103667933","display_name":"Yan Zhong","orcid":"https://orcid.org/0009-0000-1960-833X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhong, Yan","raw_affiliation_strings":["Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA"],"raw_orcid":"https://orcid.org/0009-0000-1960-833X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.5851,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.97201229,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"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.8015999794006348,"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.8015999794006348,"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.1678999960422516,"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.005400000140070915,"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/constant","display_name":"Constant (computer programming)","score":0.638700008392334},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5622000098228455},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5616999864578247},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5561000108718872},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5349000096321106},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5328999757766724},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.532800018787384},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5180000066757202},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4805000126361847}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6510000228881836},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.638700008392334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6283000111579895},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5622000098228455},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5616999864578247},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5561000108718872},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5349000096321106},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5328999757766724},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.532800018787384},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5180000066757202},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4805000126361847},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4643999934196472},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4180000126361847},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.41339999437332153},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.39410001039505005},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C190560348","wikidata":"https://www.wikidata.org/wiki/Q3245116","display_name":"Circuit design","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C2777044963","wikidata":"https://www.wikidata.org/wiki/Q5384707","display_name":"Equivalence class (music)","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.26499998569488525},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25366","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.79","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},{"id":"doi:10.4230/lipics.itcs.2026.79","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2026.79","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25366","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.79","pdf_url":null,"source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Range":[1],"Avoidance":[2],"(Avoid)":[3],"problem":[4,36,118,195],"C-Avoid[n,m(n)]":[5],"asks":[6],"that,":[7],"given":[8],"a":[9,12,26,39],"circuit":[10,48,79,146,159,264],"in":[11,29,42,105,358],"class":[13,129,160],"C":[14,161,186],"with":[15],"input":[16],"length":[17,21],"n":[18],"and":[19,51,62,66,119,148,178,228,282,290,304],"output":[20],"m(n)":[22],">":[23,175,293,340],"n,":[24],"find":[25],"string":[27],"not":[28],"the":[30,33,109,115,128,141,150,255,272,277,343,363],"range":[31],"of":[32,111,188,199,225,258,275,313,328],"circuit.":[34],"This":[35,191],"has":[37],"been":[38],"central":[40],"piece":[41],"several":[43],"recent":[44],"frameworks":[45],"for":[46,73,114,127,169,218,235,237,262,300,323,335,337,347,355],"proving":[47],"lower":[49,80,121],"bounds":[50,122],"constructing":[52],"explicit":[53],"combinatorial":[54],"objects.":[55],"Previous":[56],"work":[57,85],"by":[58,63,95,139,185,196,208,222,248,311],"Korten":[59,197],"(FOCS'":[60,68,230],"21)":[61],"Ren,":[64,226],"Santhanam,":[65,227],"Wang":[67,229],"22)":[69],"showed":[70],"that":[71,221],"algorithms":[72,113,261,322,334,354],"Avoid":[74,117],"are":[75],"closely":[76],"related":[77],"to":[78,144],"bounds.":[81],"In":[82,131],"particular,":[83],"Korten\u2019s":[84],"reinterpreted":[86],"an":[87,103,166,193,215,223,232,297],"earlier":[88],"result":[89,143],"from":[90],"bounded":[91],"arithmetic,":[92],"originally":[93],"proved":[94],"Je\u0159\u00e1bek":[96],"(Ann.":[97],"Pure":[98],"Appl.":[99],"Log.":[100],"2004),":[101],"as":[102,267],"equivalence":[104,142],"computational":[106],"complexity":[107],"between":[108],"existence":[110],"FP^NP":[112,167,216,233,259,298],"general":[116,124],"2^{\u03a9(n)}":[120],"against":[123],"Boolean":[125],"circuits":[126,187,312],"\ud835\udc04^NP.":[130],"this":[132],"work,":[133],"we":[134,317],"significantly":[135],"complement":[136],"these":[137],"works":[138],"generalizing":[140],"restricted":[145],"classes":[147,265],"obtain":[149],"following:":[151],"-":[152,202,284,325,330,351],"For":[153,285],"any":[154,172,238,338,348],"constant":[155,173,239,291],"depth":[156],"unbounded":[157],"fan-in":[158],"\u2287":[162],"AC\u2070,":[163],"there":[164,213,295],"is":[165,214,296],"algorithm":[168,217,234,299,346],"C-Avoid[n,n^{1+\u03b5}]":[170],"(for":[171],"\u03b5":[174,339],"0)":[176],"if":[177,180,303,306],"only":[179,305],"\ud835\udc04^NP":[181,204,244,307],"cannot":[182,205,245,308],"be":[183,206,246,309],"computed":[184,207,247],"size":[189,210,250,314],"2^{o(n)}.":[190,315],"addresses":[192],"open":[194],"(Bulletin":[198],"EATCS'":[200],"25).":[201],"If":[203],"o(2\u207f/n)":[209,249],"formulas,":[211],"then":[212],"NC\u2070-Avoid[n,2n].":[219],"Note":[220],"extension":[224],"22),":[231],"NC\u2070\u2084-Avoid[n,n+n^\u03b4]":[236],"\u03b4":[240],"\u2208":[241],"(0,1)":[242],"implies":[243],"formulas.":[251],"These":[252],"results":[253],"yield":[254],"first":[256,344],"characterizations":[257],"C-Avoid":[260],"low-complexity":[263],"such":[266],"AC\u2070.":[268],"We":[269],"also":[270,318],"consider":[271],"average-case":[273],"analog":[274],"Avoid,":[276],"Remote":[278],"Point":[279],"(Remote-Point)":[280],"problem,":[281],"establish:":[283],"some":[286],"suitable":[287],"function":[288],"c(n)":[289],"\u03b3":[292],"0,":[294,341],"Remote-Point[n,n^{6+\u03b3},c(O_{\u03b3}(log":[301],"n))]":[302],"(1/2-c(n))-approximated":[310],"Finally,":[316],"present":[319],"two":[320],"improved":[321],"NC\u2070-Avoid:":[324],"A":[326],"family":[327],"2^{n^{1":[329],"\u03b5/(k-1)":[331],"+o(1)}}":[332],"time":[333,359],"NC\u2070_k-Avoid[n,n^{1+\u03b5}]":[336],"exhibiting":[342],"subexponential-time":[345],"super-linear":[349],"stretch.":[350],"Faster":[352],"local":[353],"NC\u2070_k-Avoid[n,n+1]":[356],"running":[357],"O(n2^{(k-2)/(k-1)":[360],"n}),":[361],"improving":[362],"naive":[364],"2\u207f\u22c5":[365],"poly(n)":[366],"bound.":[367]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-24T00:00:00"}