{"id":"https://openalex.org/W2155949379","doi":"https://doi.org/10.1007/s00037-005-0199-5","title":"Language compression and pseudorandom generators","display_name":"Language compression and pseudorandom generators","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2155949379","doi":"https://doi.org/10.1007/s00037-005-0199-5","mag":"2155949379"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-005-0199-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-005-0199-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0199-5.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0199-5.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083983355","display_name":"Harry Buhrman","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Harry Buhrman","raw_affiliation_strings":["CWI and University of Amsterdam, 1098 SJ, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI and University of Amsterdam, 1098 SJ, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083542323","display_name":"Troy Lee","orcid":"https://orcid.org/0000-0001-6912-2338"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Troy Lee","raw_affiliation_strings":["CWI and University of Amsterdam, 1098 SJ, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI and University of Amsterdam, 1098 SJ, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111961315","display_name":"Dieter van Melkebeek","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dieter van Melkebeek","raw_affiliation_strings":["University of Wisconsin-Madison, Madison, WI, 53706-1685, U.S.A"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, Madison, WI, 53706-1685, U.S.A","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083983355"],"corresponding_institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I887064364"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.3713,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85851909,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":"3","first_page":"228","last_page":"255"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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":0.9979000091552734,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7181309461593628},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.6987013816833496},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6852961778640747},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6098509430885315},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5677196383476257},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.513090968132019},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5119549036026001},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.5099085569381714},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.4989805221557617},{"id":"https://openalex.org/keywords/pseudorandom-generator","display_name":"Pseudorandom generator","score":0.4361763894557953},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4321378171443939},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.41498059034347534},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20411208271980286},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.19633787870407104},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09645634889602661}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7181309461593628},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.6987013816833496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6852961778640747},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6098509430885315},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5677196383476257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.513090968132019},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5119549036026001},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.5099085569381714},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.4989805221557617},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.4361763894557953},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4321378171443939},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.41498059034347534},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20411208271980286},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.19633787870407104},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09645634889602661},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00037-005-0199-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-005-0199-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0199-5.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00037-005-0199-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-005-0199-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-005-0199-5.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3288618736","display_name":"CAREER: Techniques for Separations and Inclusions of Complexity Classes","funder_award_id":"0133693","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":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2155949379.pdf","grobid_xml":"https://content.openalex.org/works/W2155949379.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1533201506","https://openalex.org/W1542401186","https://openalex.org/W1563159456","https://openalex.org/W1572772224","https://openalex.org/W1596720500","https://openalex.org/W1638203394","https://openalex.org/W1797136128","https://openalex.org/W1874167488","https://openalex.org/W1901622511","https://openalex.org/W1967175855","https://openalex.org/W1975790950","https://openalex.org/W1992499648","https://openalex.org/W1998918799","https://openalex.org/W2004471951","https://openalex.org/W2011465227","https://openalex.org/W2062965695","https://openalex.org/W2083237534","https://openalex.org/W2089272132","https://openalex.org/W2103517359","https://openalex.org/W2119913278","https://openalex.org/W2131798840","https://openalex.org/W2149001195","https://openalex.org/W2401419959","https://openalex.org/W2611805533","https://openalex.org/W3138266838","https://openalex.org/W4210300416","https://openalex.org/W4213009134","https://openalex.org/W4230960895","https://openalex.org/W4233444803","https://openalex.org/W4237363759","https://openalex.org/W6609165609","https://openalex.org/W6633411947","https://openalex.org/W6681866618"],"related_works":["https://openalex.org/W2795569938","https://openalex.org/W4242117757","https://openalex.org/W1576065320","https://openalex.org/W3197588836","https://openalex.org/W2015880590","https://openalex.org/W1513039030","https://openalex.org/W2166239524","https://openalex.org/W2553569605","https://openalex.org/W95325373","https://openalex.org/W1503589388"],"abstract_inverted_index":{"The":[0,193,209],"language":[1,13],"compression":[2],"problem":[3],"asks":[4],"for":[5,31,61,212],"succinct":[6],"descriptions":[7],"of":[8,53,65,67,86,117,131,150,154,161,176,184,204],"the":[9,17,48,62,76,147,174,217,225],"strings":[10,18,66,151],"in":[11,152,187],"a":[12,28,128,158,181],"A":[14,153,188],"such":[15],"that":[16,179],"can":[19,45,74,110],"be":[20],"efficiently":[21],"recovered":[22],"from":[23,189],"their":[24],"description":[25,63,148],"when":[26],"given":[27,182],"membership":[29],"oracle":[30],"A.":[32],"We":[33],"study":[34],"randomized":[35],"and":[36,40,107,157],"nondeterministic":[37],"decompression":[38],"schemes":[39],"investigate":[41],"how":[42],"close":[43],"we":[44,73,109,126],"get":[46],"to":[47,82,200],"information":[49,77],"theoretic":[50,78],"lower":[51,79,129,159,195],"bound":[52,80,130,160,196],"$$\\log":[54],"{\\left\\|":[55,91,135,165],"{A^{{":[56,92,136,166],"=":[57,93,137,167],"n}}":[58,94,138,168],"}":[59,95,97,139,169],"\\right\\|}$$":[60],"length":[64,68,149,155,175,185],"n.":[69],"Using":[70],"nondeterminism":[71,106],"alone,":[72,125],"achieve":[75],"up":[81,199],"an":[83,114,201],"additive":[84,202],"term":[85,116,203],"$$O{\\left(":[87,118,205],"{{\\left(":[88],"{{\\sqrt":[89],"{\\log":[90,119,143,206],"\\right\\|}}":[96],"+":[98],"\\log":[99,134,164],"n}":[100,102,121,144,207],"\\right)}\\log":[101],"\\right)};$$":[103],"using":[104],"both":[105],"randomness,":[108],"make":[111],"do":[112],"with":[113],"excess":[115],"^{3}":[120],"\\right)}.$$":[122,208],"With":[123],"randomness":[124,221],"show":[127],"$$n":[132],"-":[133,141,171],"\\right\\|}":[140,170],"O{\\left(":[142],"\\right)}$$":[145],"on":[146,173,224],"n,":[156],"$$2":[162],"\\cdot":[163],"O(1)$$":[172],"any":[177,190],"program":[178],"distinguishes":[180],"string":[183],"n":[186],"other":[191],"string.":[192],"latter":[194],"is":[197,216],"tight":[198],"key":[210],"ingredient":[211],"our":[213],"upper":[214],"bounds":[215],"relativizable":[218],"hardness":[219],"versus":[220],"tradeoffs":[222],"based":[223],"Nisan\u2013Wigderson":[226],"pseudorandom":[227],"generator":[228],"construction.":[229]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}