{"id":"https://openalex.org/W138632766","doi":null,"title":"Kolmogorov complexity and derandomization","display_name":"Kolmogorov complexity and derandomization","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W138632766","mag":"138632766"},"language":"en","primary_location":{"id":"mag:138632766","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1087202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5039969826","display_name":"Detlef Ronneburger","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Detlef Ronneburger","raw_affiliation_strings":["Rutgers, The State University of New Jersey [New Brunswick]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers, The State University of New Jersey [New Brunswick]","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078734824","display_name":"Eric Allender","orcid":"https://orcid.org/0000-0002-0650-028X","observed_orcids":["https://orcid.org/0000-0002-0650-028X"]},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Allender","raw_affiliation_strings":["Rutgers, The State University of New Jersey [New Brunswick]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers, The State University of New Jersey [New Brunswick]","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":0.3916,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58645276,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994999766349792,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"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":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/derandomization","display_name":"derandomization","score":0.8740000128746033},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"universal Turing machine","score":0.6119999885559082}],"concepts":[{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.9458469152450562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.596993088722229},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5139641165733337},{"id":"https://openalex.org/C15995199","wikidata":"https://www.wikidata.org/wiki/Q5805968","display_name":"Kolmogorov structure function","level":3,"score":0.5110393762588501},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.509601354598999},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.4982750415802002},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49660760164260864},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.46214306354522705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4487643241882324},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.43358397483825684},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4328461289405823},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.42324942350387573},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42202049493789673},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41016918420791626},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3944535553455353},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38369113206863403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2799251675605774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2047470211982727},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.11031687259674072},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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":"mag:138632766","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1087202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":63,"referenced_works":["https://openalex.org/W41330591","https://openalex.org/W109076699","https://openalex.org/W189979554","https://openalex.org/W1481926168","https://openalex.org/W1533201506","https://openalex.org/W1538406570","https://openalex.org/W1552471286","https://openalex.org/W1558847040","https://openalex.org/W1563159456","https://openalex.org/W1579803260","https://openalex.org/W1596720500","https://openalex.org/W1638203394","https://openalex.org/W1788833175","https://openalex.org/W1822243375","https://openalex.org/W1865392646","https://openalex.org/W1901622511","https://openalex.org/W1904122824","https://openalex.org/W1918236823","https://openalex.org/W1969678783","https://openalex.org/W1975790950","https://openalex.org/W1978909760","https://openalex.org/W1986188250","https://openalex.org/W1993138363","https://openalex.org/W1996484429","https://openalex.org/W1998918799","https://openalex.org/W2004471951","https://openalex.org/W2006936891","https://openalex.org/W2011039300","https://openalex.org/W2011465227","https://openalex.org/W2015880590","https://openalex.org/W2021736779","https://openalex.org/W2029308360","https://openalex.org/W2031495811","https://openalex.org/W2041404167","https://openalex.org/W2041517255","https://openalex.org/W2045717693","https://openalex.org/W2061106457","https://openalex.org/W2069035846","https://openalex.org/W2078472124","https://openalex.org/W2097206148","https://openalex.org/W2103502708","https://openalex.org/W2105038944","https://openalex.org/W2107205051","https://openalex.org/W2116395240","https://openalex.org/W2117362057","https://openalex.org/W2121626225","https://openalex.org/W2125495920","https://openalex.org/W2131798840","https://openalex.org/W2132833941","https://openalex.org/W2140441560","https://openalex.org/W2142048307","https://openalex.org/W2147861440","https://openalex.org/W2151306421","https://openalex.org/W2154462988","https://openalex.org/W2158747250","https://openalex.org/W2159841662","https://openalex.org/W2164284862","https://openalex.org/W2169453948","https://openalex.org/W2170154494","https://openalex.org/W2268443045","https://openalex.org/W2569165898","https://openalex.org/W2912080987","https://openalex.org/W2998808137"],"related_works":["https://openalex.org/W7100113868","https://openalex.org/W226726922","https://openalex.org/W7131858844","https://openalex.org/W2108585502","https://openalex.org/W2109677942","https://openalex.org/W7096400580","https://openalex.org/W2121626225","https://openalex.org/W2947191600","https://openalex.org/W2159841662","https://openalex.org/W6910142992"],"abstract_inverted_index":{"Kolmogorov":[0,25,69,129,253],"complexity":[1,15,26,77,170,232,236,254,271,281,308,320],"is":[2,108,114,139,193,197,201,258,325],"a":[3,10,17,36,49,85,109,142,177,256,260,270,274],"measure":[4,91,174],"that":[5,81,141,199,266,293,327],"describes":[6],"the":[7,121,127,159,166,169,173,248,252,280,287,299],"compressibility":[8],"of":[9,19,32,67,146,153,158,162,168,171,230,245,250,255,279,304],"string.":[11],"Strings":[12],"with":[13,23],"low":[14,46],"contain":[16],"lot":[18],"redundancy,":[20],"while":[21,48],"strings":[22,313],"high":[24,60],"seem":[27,290],"to":[28,118,291,310],"lack":[29,292],"any":[30],"kind":[31],"pattern.":[33],"For":[34,322],"instance,":[35,323],"string":[37,179,257],"such":[38,51],"as":[39,52,92,215,217,240,247],"5555":[40,41,42,43,44],"has":[45],"complexity,":[47,130],"sequence":[50],"1732":[53],"7356":[54],"2748":[55],"7621":[56],"6552":[57],"would":[58],"have":[59,273],"complexity.":[61,70],"\r\nThis":[62,295],"thesis":[63,164,296],"studies":[64,74,298],"different":[65,235,319],"notions":[66],"resource-bounded":[68],"In":[71,136],"particular":[72,137],"it":[73,138,196,200,324],"Levin's":[75],"Kt":[76],"and":[78,314,336],"measures":[79,122,155,233],"K\u03bc":[80,123],"are":[82,238,244,267],"defined":[83,89],"in":[84,103,185,213,225,306,330],"similar":[86],"manner.":[87],"Levin":[88],"his":[90],"Kt(":[93],"x)":[94],"=":[95,101],"min{|d|":[96],"+":[97],"logt":[98],"|":[99],"U(d)":[100],"x":[102],"t":[104],"steps}":[105],"where":[106],"U":[107],"universal":[110],"Turing":[111],"machine.":[112],"It":[113,181],"shown":[115,198,326],"that,":[116],"contrary":[117],"common":[119],"intuition,":[120],"behave":[124],"differently":[125],"from":[126],"resource-unbounded":[128],"even":[131],"for":[132,151,176,203,234,269],"generous":[133],"resource":[134],"bounds.":[135],"argued":[140],"property":[143],"called":[144],"Symmetry":[145],"Information":[147],"does":[148],"not":[149,259],"hold":[150],"some":[152],"these":[154],"K\u03bc.":[156],"\r\nOne":[157],"main":[160],"results":[161,229,243],"this":[163],"addresses":[165],"question":[167],"computing":[172,251],"Kt(x)":[175],"given":[178],"x.":[180],"can":[182],"be":[183],"computed":[184],"exponential":[186,204],"time,":[187],"but":[188],"no":[189],"meaningful":[190],"lower":[191],"bound":[192],"known.":[194],"However,":[195,286],"complete":[202,262,268],"time":[205,220],"under":[206],"efficient,":[207],"non-uniform":[208],"reductions":[209,211,221,223],"(i.e.,":[210,222],"computable":[212,224],"P/poly)":[214],"well":[216],"nondeterministic":[218],"polynomial":[219],"NP).":[226],"Further":[227],"completeness":[228],"other":[231],"classes":[237,272,309],"obtained":[239],"well.":[241],"These":[242],"interest":[246],"problem":[249],"typical":[261],"problem.":[263],"Most":[264],"problems":[265,288],"clear":[275],"combinatorial":[276],"structure":[277],"representative":[278],"class":[282],"they":[283],"reside":[284],"in.":[285],"studied":[289],"property.":[294],"also":[297],"relation":[300,317],"between":[301,318],"(a)\u00a0the":[302],"ability":[303],"sets":[305],"certain":[307],"avoid":[311],"simple":[312,333],"(b)\u00a0the":[315],"inclusion":[316],"classes.":[321],"every":[328],"set":[329],"P":[331],"contains":[332],"strings,":[334],"if":[335,338],"only":[337],"NEXP":[339],"\u2286":[340],"P/poly.":[341]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}