{"id":"https://openalex.org/W7125514376","doi":"https://doi.org/10.4230/lipics.itcs.2026.97","title":"One-Way Functions and Boundary Hardness of Randomized Time-Bounded Kolmogorov Complexity","display_name":"One-Way Functions and Boundary Hardness of Randomized Time-Bounded Kolmogorov Complexity","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7125514376","doi":"https://doi.org/10.4230/lipics.itcs.2026.97"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25384","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.97","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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":"InProceedings"},"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.97","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046626780","display_name":"Yanyi Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]},{"id":"https://openalex.org/I4405261073","display_name":"Cornell Tech","ror":"https://ror.org/04qscbg47","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295","https://openalex.org/I4405261073"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liu, Yanyi","raw_affiliation_strings":["Cornell Tech, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell Tech, New York, NY, USA","institution_ids":["https://openalex.org/I205783295","https://openalex.org/I4405261073"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081609749","display_name":"Rafael Pass","orcid":"https://orcid.org/0000-0001-7440-5690"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]},{"id":"https://openalex.org/I4405261073","display_name":"Cornell Tech","ror":"https://ror.org/04qscbg47","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295","https://openalex.org/I4405261073"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pass, Rafael","raw_affiliation_strings":["Cornell Tech, Technion, TAU, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell Tech, Technion, TAU, New York, NY, USA","institution_ids":["https://openalex.org/I205783295","https://openalex.org/I4405261073"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11926739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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.9074000120162964,"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.9074000120162964,"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.025499999523162842,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.020099999383091927,"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/string","display_name":"String (physics)","score":0.58160001039505},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5740000009536743},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.5666999816894531},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5407000184059143},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5304999947547913},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.5013999938964844},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.41449999809265137}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7552000284194946},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.58160001039505},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5740000009536743},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.5666999816894531},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5407000184059143},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5304999947547913},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.5013999938964844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44519999623298645},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.40139999985694885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.392300009727478},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2648000121116638}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25384","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.97","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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":"InProceedings"},{"id":"doi:10.4230/lipics.itcs.2026.97","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2026.97","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25384","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2026.97","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","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":"InProceedings"},"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":{"We":[0],"revisit":[1],"the":[2,9,38,61,102,116,146,155,172,175,200,229,235,236,243,248,268,276,292],"question":[3],"of":[4,8,40,51,55,101,110,119,154,184,195,225,267],"whether":[5,19,66,281],"worst-case":[6,49,238],"hardness":[7,50,153],"time-bounded":[10],"Kolmogorov":[11],"complexity":[12],"problem,":[13,270],"MINK^{poly}":[14,56,245,269],"-":[15,34,57,92,95,212],"that":[16,48,151,171,260],"is,":[17],"determining":[18],"a":[20,52,107,182,190,264],"string":[21,176],"is":[22,63,73,165,278],"\"structured\"":[23],"(i.e.,":[24,30,75,84],"K^t(x)":[25,164,169,282],"<":[26,86],"n-1)":[27,33],"or":[28,79,121,286],"\"random\"":[29],"K^{poly(t)}":[31,89],"\u2265":[32,77,288],"suffices":[35,161],"to":[36,64,82,115,206,239,263,272,279],"imply":[37],"existence":[39],"one-way":[41],"functions":[42],"(OWF).":[43],"Liu-Pass":[44],"(CRYPTO'25)":[45],"recently":[46],"showed":[47],"boundary":[53,152],"version":[54,266],"where,":[58],"roughly":[59],"speaking,":[60],"goal":[62,277],"decide":[65,280],"given":[67],"an":[68,135],"instance":[69],"x,":[70],"(a)":[71],"x":[72,177],"K^poly-random":[74,83],"K^{poly(t)}(x)":[76,287],"n-1),":[78],"just":[80,167,196,208],"close":[81],"K^{t}(x)":[85],"n-1":[87,289],"but":[88,98],">":[90],"n":[91],"log":[93],"n)":[94],"characterizes":[96],"OWF,":[97],"with":[99],"either":[100],"following":[103],"caveats":[104],"(1)":[105],"considering":[106],"non-standard":[108],"notion":[109,118],"probabilistic":[111],"K^t,":[112,120],"as":[113,273],"opposed":[114],"standard":[117,157,202,250],"(2)":[122],"assuming":[123],"somewhat":[124],"strong,":[125],"and":[126,290],"non-standard,":[127],"derandomization":[128,203,251,294],"assumptions.":[129],"In":[130],"this":[131,185],"paper,":[132],"we":[133,149,187,232],"present":[134,234],"alternative":[136],"method":[137],"for":[138,242],"establishing":[139],"their":[140],"result":[141],"which":[142],"enables":[143],"significantly":[144],"weakening":[145],"caveats.":[147],"First,":[148],"show":[150],"more":[156],"randomized":[158,163],"K^t":[159,198],"problem":[160,246],"(where":[162],"defined":[166],"like":[168],"except":[170],"program":[173],"generating":[174],"may":[178],"be":[179],"randomized).":[180],"As":[181],"consequence":[183],"result,":[186],"can":[188],"provide":[189],"characterization":[191],"also":[192,233],"in":[193],"terms":[194],"\"plain\"":[197],"under":[199,291],"most":[201],"assumption":[204],"(used":[205],"derandomize":[207],"BPP":[209],"into":[210],"P)":[211],"namely":[213],"E":[214],"\u0338":[215],"\u2286":[216],"ioSIZE[2^{o(n)}].":[217],"Our":[218],"proof":[219],"relies":[220],"on":[221],"language":[222],"compression":[223],"schemes":[224],"Goldberg-Sipser":[226],"(STOC'85);":[227],"using":[228],"same":[230,249,293],"technique,":[231],"first":[237],"average-case":[240],"reduction":[241],"exact":[244],"(under":[247],"assumption),":[252],"improving":[253],"upon":[254],"Hirahara\u2019s":[255],"celebrated":[256],"results":[257],"(STOC'18,":[258],"STOC'21)":[259],"only":[261],"applied":[262],"gap":[265],"referred":[271],"GapMINK^{poly},":[274],"where":[275],"\u2264":[283],"n-O(log":[284],"n))":[285],"assumption.":[295]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-01-24T00:00:00"}