{"id":"https://openalex.org/W2140496184","doi":"https://doi.org/10.1007/s00037-012-0039-3","title":"Bounded-Depth Circuits Cannot Sample Good Codes","display_name":"Bounded-Depth Circuits Cannot Sample Good Codes","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2140496184","doi":"https://doi.org/10.1007/s00037-012-0039-3","mag":"2140496184"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-012-0039-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-012-0039-3","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044999305","display_name":"Shachar Lovett","orcid":"https://orcid.org/0000-0003-4552-1443"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shachar Lovett","raw_affiliation_strings":["School of Mathematics, Institute of Advanced Studies, Princeton, USA","The Institute of Advanced Study, Princeton, NJ, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, Institute of Advanced Studies, Princeton, USA","institution_ids":["https://openalex.org/I40036882"]},{"raw_affiliation_string":"The Institute of Advanced Study, Princeton, NJ, USA#TAB#","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072846764","display_name":"Emanuele Viola","orcid":"https://orcid.org/0000-0001-6091-1824"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emanuele Viola","raw_affiliation_strings":["College of Computer and Information Science, Northeastern University, Boston, USA","Northeastern University Boston MA USA"],"affiliations":[{"raw_affiliation_string":"College of Computer and Information Science, Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Northeastern University Boston MA USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044999305"],"corresponding_institution_ids":["https://openalex.org/I40036882"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.6277,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.70842432,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"2","first_page":"243","last_page":"251"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.7218464016914368},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6019025444984436},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5909412503242493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5861166715621948},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5820069313049316},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.576476514339447},{"id":"https://openalex.org/keywords/pseudorandomness","display_name":"Pseudorandomness","score":0.5736811757087708},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5313140749931335},{"id":"https://openalex.org/keywords/pseudorandom-generator","display_name":"Pseudorandom generator","score":0.5057027339935303},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4880634546279907},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.47384506464004517},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.46758079528808594},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44679194688796997},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4254576563835144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3140581548213959},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2744218111038208},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1538800299167633},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07804355025291443}],"concepts":[{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.7218464016914368},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6019025444984436},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5909412503242493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5861166715621948},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5820069313049316},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.576476514339447},{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.5736811757087708},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5313140749931335},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.5057027339935303},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4880634546279907},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.47384506464004517},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.46758079528808594},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44679194688796997},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4254576563835144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3140581548213959},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2744218111038208},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1538800299167633},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07804355025291443},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00037-012-0039-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-012-0039-3","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"doi:10.1109/ccc.2011.11","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2011.11","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE 26th Annual Conference on Computational Complexity","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.174.4824","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.4824","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ccs.neu.edu/home/viola/papers/LoV.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.1300","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.1300","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ccs.neu.edu/home/viola/papers/LoV.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.379.9351","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.379.9351","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.northeastern.edu/home/viola/papers/LoV.pdf","raw_type":"text"},{"id":"mag:2140496184","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc17.html#LovettV10","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1995851745","https://openalex.org/W2017290750","https://openalex.org/W2023915883","https://openalex.org/W2036447017","https://openalex.org/W2042194938","https://openalex.org/W2043819676","https://openalex.org/W2058859323","https://openalex.org/W2063054346","https://openalex.org/W2088559598","https://openalex.org/W2090418561","https://openalex.org/W2100218277","https://openalex.org/W2101403145","https://openalex.org/W2109322425","https://openalex.org/W2121048498","https://openalex.org/W2133938058","https://openalex.org/W2141431275","https://openalex.org/W2155834086","https://openalex.org/W2168941042","https://openalex.org/W3111890340","https://openalex.org/W3143506846","https://openalex.org/W6678145804"],"related_works":["https://openalex.org/W3202125008","https://openalex.org/W2952439183","https://openalex.org/W2569811742","https://openalex.org/W2914633004","https://openalex.org/W890943137","https://openalex.org/W2070325307","https://openalex.org/W2949902763","https://openalex.org/W1965097372","https://openalex.org/W2565371960","https://openalex.org/W1904286506","https://openalex.org/W1920077183","https://openalex.org/W3142606116","https://openalex.org/W2950602236","https://openalex.org/W2962784195","https://openalex.org/W2951827317","https://openalex.org/W1902733887","https://openalex.org/W2120164218","https://openalex.org/W2951729012","https://openalex.org/W2895930323","https://openalex.org/W2975473692"],"abstract_inverted_index":{"We":[0,18,68],"study":[1],"a":[2,20,84,102],"variant":[3],"of":[4,32,65,73,83,95,110,118,125,135],"the":[5,24,29,41,61,96,111,115],"classical":[6],"circuit-lower-bound":[7],"problems:":[8],"proving":[9],"lower":[10,21,63],"bounds":[11],"for":[12,80,107],"sampling":[13],"distributions":[14],"given":[15],"random":[16],"bits.":[17],"prove":[19],"bound":[22,64],"on":[23],"statistical":[25],"distance":[26,54],"between":[27],"(i)":[28],"output":[30,116],"distribution":[31,43,117],"any":[33,45,77],"small":[34,103,132],"constant-depth":[35],"(a.k.a.":[36],"AC0)":[37],"circuit,":[38],"and":[39,55],"(ii)":[40],"uniform":[42],"over":[44],"code":[46,86],"that":[47],"is":[48],"``good'',":[49],"i.e.":[50],"has":[51],"constant":[52],"relative":[53],"rate.":[56],"This":[57],"seems":[58],"to":[59],"be":[60,99,129],"first":[62],"this":[66,74],"kind.":[67],"give":[69],"two":[70],"simple":[71],"applications":[72],"result:":[75],"(1)":[76],"data":[78],"structure":[79],"storing":[81],"codewords":[82],"good":[85],"requires":[87],"an":[88],"additive":[89],"logarithmic":[90],"redundancy,":[91],"if":[92],"each":[93],"bit":[94],"codeword":[97],"can":[98],"retrieved":[100],"by":[101,131],"AC0":[104,123,133],"circuit;":[105],"(2)":[106],"some":[108],"choice":[109],"underlying":[112],"combinatorial":[113],"designs,":[114],"Nisan's":[119],"pseudorandom":[120],"generator":[121],"against":[122],"circuits":[124,134],"depth":[126,136],"d":[127],"cannot":[128],"sampled":[130],"less":[137],"than":[138],"d.":[139]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}