{"id":"https://openalex.org/W1980147712","doi":"https://doi.org/10.1145/1132516.1132615","title":"On the randomness complexity of efficient sampling","display_name":"On the randomness complexity of efficient sampling","publication_year":2006,"publication_date":"2006-05-21","ids":{"openalex":"https://openalex.org/W1980147712","doi":"https://doi.org/10.1145/1132516.1132615","mag":"1980147712"},"language":"en","primary_location":{"id":"doi:10.1145/1132516.1132615","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"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/A5038678976","display_name":"Bella Dubrov","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Bella Dubrov","raw_affiliation_strings":["Technion"],"affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081852077","display_name":"Yuval Ishai","orcid":"https://orcid.org/0009-0009-4096-6305"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yuval Ishai","raw_affiliation_strings":["Technion"],"affiliations":[{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038678976"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":4.3995,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.94391605,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"711","last_page":"720"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991999864578247,"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/pseudorandomness","display_name":"Pseudorandomness","score":0.9349299669265747},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.8160945177078247},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.7544035911560059},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5477246642112732},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5423283576965332},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5174494385719299},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.5170581936836243},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5055751800537109},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4663378894329071},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.43710583448410034},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43612104654312134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4350837767124176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4225625991821289},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42080971598625183},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12631762027740479}],"concepts":[{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.9349299669265747},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.8160945177078247},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.7544035911560059},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5477246642112732},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5423283576965332},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5174494385719299},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.5170581936836243},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5055751800537109},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4663378894329071},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.43710583448410034},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43612104654312134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4350837767124176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4225625991821289},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42080971598625183},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12631762027740479},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1132516.1132615","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132615","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W107779203","https://openalex.org/W126880940","https://openalex.org/W1490590996","https://openalex.org/W1494083255","https://openalex.org/W1499074627","https://openalex.org/W1500761685","https://openalex.org/W1518083319","https://openalex.org/W1563159456","https://openalex.org/W1572772224","https://openalex.org/W1595485507","https://openalex.org/W1598224844","https://openalex.org/W1626447266","https://openalex.org/W1805653176","https://openalex.org/W1901622511","https://openalex.org/W1966205523","https://openalex.org/W1979479253","https://openalex.org/W1982991092","https://openalex.org/W1998918799","https://openalex.org/W2006453614","https://openalex.org/W2011438986","https://openalex.org/W2015880590","https://openalex.org/W2017290750","https://openalex.org/W2021736779","https://openalex.org/W2027528470","https://openalex.org/W2033027791","https://openalex.org/W2035912926","https://openalex.org/W2042194938","https://openalex.org/W2053362087","https://openalex.org/W2060474153","https://openalex.org/W2065703771","https://openalex.org/W2080911030","https://openalex.org/W2086915908","https://openalex.org/W2107324709","https://openalex.org/W2123852216","https://openalex.org/W2126274204","https://openalex.org/W2158747250","https://openalex.org/W2160403361","https://openalex.org/W2164284862","https://openalex.org/W2504389667","https://openalex.org/W2611754984","https://openalex.org/W2996041333","https://openalex.org/W2998808137","https://openalex.org/W3150645827"],"related_works":["https://openalex.org/W4241950541","https://openalex.org/W2152662275","https://openalex.org/W2135453633","https://openalex.org/W4287184260","https://openalex.org/W2978186572","https://openalex.org/W2783162249","https://openalex.org/W3162399915","https://openalex.org/W1550380891","https://openalex.org/W3171885940","https://openalex.org/W2222689550"],"abstract_inverted_index":{"We":[0,52],"consider":[1,44],"the":[2,25,38,87,98,103],"following":[3,104],"question:":[4],"Can":[5],"every":[6],"efficiently":[7,11,76],"samplable":[8],"distribution":[9],"be":[10],"sampled,":[12],"up":[13],"to":[14,90],"a":[15,31,54,59,82],"small":[16],"statistical":[17],"distance,":[18],"using":[19],"roughly":[20],"as":[21,24],"much":[22],"randomness":[23],"length":[26],"of":[27,33,41,61,106],"its":[28],"output?":[29],"Towards":[30],"study":[32],"this":[34],"question":[35,100],"we":[36,96],"generalize":[37],"current":[39],"theory":[40],"pseudorandomness":[42],"and":[43,58,67],"pseudorandom":[45],"generators":[46],"that":[47,84],"fool":[48],"non-boolean":[49],"distinguishers":[50],"(nb-PRGs).":[51],"show":[53],"link":[55],"between":[56],"nb-PRGs":[57],"notion":[60],"function":[62],"compression,":[63],"introduced":[64],"by":[65],"Harnik":[66],"Naor":[68],"[16].":[69],"(A":[70],"compression":[71],"algorithm":[72],"for":[73],"f":[74],"should":[75],"compress":[77],"an":[78],"input":[79],"x":[80],"in":[81],"way":[83],"will":[85],"preserve":[86],"information":[88],"needed":[89],"compute":[91],"f(x).)":[92],"By":[93],"constructing":[94],"nb-PRGs,":[95],"answer":[97],"above":[99],"affirmatively":[101],"under":[102],"types":[105],"assumptions:":[107]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}