{"id":"https://openalex.org/W7170190494","doi":"https://doi.org/10.4230/lipics.ccc.2026.9","title":"Hardness of Computing Nondeterministic Kolmogorov Complexity","display_name":"Hardness of Computing Nondeterministic Kolmogorov Complexity","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170190494","doi":"https://doi.org/10.4230/lipics.ccc.2026.9"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.9","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"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":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111207783","display_name":"Jinqiao Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hu, Jinqiao","raw_affiliation_strings":["University of Warwick, UK"],"raw_orcid":"https://orcid.org/0009-0008-8798-639X","affiliations":[{"raw_affiliation_string":"University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032937708","display_name":"Zhenjian Lu","orcid":"https://orcid.org/0009-0007-3990-4751"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Lu, Zhenjian","raw_affiliation_strings":["University of Victoria, Canada"],"raw_orcid":"https://orcid.org/0009-0007-3990-4751","affiliations":[{"raw_affiliation_string":"University of Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063275856","display_name":"Igor C. Oliveira","orcid":"https://orcid.org/0000-0003-4048-2385"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Oliveira, Igor C.","raw_affiliation_strings":["University of Warwick, UK"],"raw_orcid":"https://orcid.org/0000-0003-4048-2385","affiliations":[{"raw_affiliation_string":"University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.9341999888420105},{"id":"https://openalex.org/keywords/kolmogorov-structure-function","display_name":"Kolmogorov structure function","score":0.8544999957084656},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.830299973487854},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.566100001335144},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5561000108718872},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5554999709129333},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.48660001158714294},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43220001459121704}],"concepts":[{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.9341999888420105},{"id":"https://openalex.org/C15995199","wikidata":"https://www.wikidata.org/wiki/Q5805968","display_name":"Kolmogorov structure function","level":3,"score":0.8544999957084656},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.830299973487854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5934000015258789},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.566100001335144},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5561000108718872},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5554999709129333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5120999813079834},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.48660001158714294},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43220001459121704},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.36550000309944153},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3499000072479248},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3449000120162964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3440999984741211},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.30480000376701355},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.2831000089645386},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.27649998664855957},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2538999915122986},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.25369998812675476},{"id":"https://openalex.org/C66024118","wikidata":"https://www.wikidata.org/wiki/Q1122506","display_name":"Computational model","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.9","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.9","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"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":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"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":{"Meta-complexity":[0],"investigates":[1],"the":[2,23,42,52,76,93,128,137,143,210,217,227,234],"complexity":[3,73,77,154,167],"of":[4,25,44,54,71,78,95,98,130,139,145,149,165,189,202,204,219,236],"computational":[5],"problems":[6,20],"and":[7,14,111,199,221],"tasks":[8],"that":[9,74,106,182,209,222],"are":[10],"themselves":[11],"about":[12],"computations":[13,85],"their":[15],"complexity.":[16,58,134],"Understanding":[17],"whether":[18],"such":[19,193],"can":[21,118,159],"capture":[22],"hardness":[24,218],"NP":[26,114],"is":[27,39,142],"a":[28,68,80,99,122,146,200],"central":[29],"research":[30,63],"direction.":[31],"A":[32],"longstanding":[33],"open":[34],"problem":[35,53,213,230],"in":[36,127],"this":[37,62,140,224],"area":[38],"to":[40,61,124,136,226],"establish":[41,180],"NP-hardness":[43],"MINKT":[45],"(Ker-I":[46],"Ko,":[47,50],"1991":[48],"[Ker{-}I":[49],"1991]),":[51],"estimating":[55,96],"time-bounded":[56,83,132,152],"Kolmogorov":[57,72,133,153,191],"We":[59,104,179],"contribute":[60],"direction":[64],"by":[65,174],"studying":[66],"nK^t,":[67],"natural":[69],"variant":[70],"captures":[75,216],"representing":[79],"string":[81,102],"using":[82],"nondeterministic":[84,131,151],"[Buhrman":[86],"et":[87,170],"al.,":[88,171],"2001].":[89],"Let":[90],"MINnKT":[91,107],"denote":[92],"task":[94],"nK^t(x)":[97],"given":[100],"input":[101],"x.":[103],"prove":[105],"\u2208":[108],"BPP":[109],"if":[110,113],"only":[112],"\u2286":[115],"BPP.":[116],"This":[117,157],"be":[119,160],"interpreted":[120],"as":[121,162,194],"solution":[123],"Ko\u2019s":[125],"question":[126],"setting":[129],"Crucial":[135],"proof":[138],"result":[141,225],"investigation":[144],"new":[147],"notion":[148],"probabilistic":[150],"called":[155],"pnK^t.":[156],"measure":[158],"seen":[161],"an":[163],"extension":[164],"pK^t":[166],"[Halley":[168],"Goldberg":[169],"2022]":[172],"obtained":[173],"replacing":[175],"\ud835\uddaa^t":[176],"with":[177],"nK^t.":[178],"unconditionally":[181],"pnK^t":[183],"has":[184],"nearly":[185],"all":[186],"key":[187],"properties":[188],"(time-unbounded)":[190],"complexity,":[192],"language":[195],"compression,":[196],"conditional":[197],"coding,":[198],"form":[201],"symmetry":[203],"information.":[205],"Finally,":[206],"we":[207],"show":[208],"corresponding":[211],"meta-computational":[212],"MINpnKT":[214],"also":[215],"NP,":[220],"extending":[223],"closely":[228],"related":[229],"Gap-MINpnKT":[231],"would":[232],"imply":[233],"exclusion":[235],"PH-Heuristica.":[237]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}