{"id":"https://openalex.org/W1996268648","doi":"https://doi.org/10.1109/focs.2012.74","title":"Lower Bounds on Interactive Compressibility by Constant-Depth Circuits","display_name":"Lower Bounds on Interactive Compressibility by Constant-Depth Circuits","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W1996268648","doi":"https://doi.org/10.1109/focs.2012.74","mag":"1996268648"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2012.74","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.pure.ed.ac.uk/ws/files/17928298/Chattopadhyay_Santhanam_2012_Lower_Bounds_on_Interactive_Compressibility_by_Constant_Depth_Circuits.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088854880","display_name":"Arkadev Chattopadhyay","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"funder","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Arkadev Chattopadhyay","raw_affiliation_strings":["University of Toronto"],"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085864294","display_name":"Rahul Santhanam","orcid":"https://orcid.org/0000-0002-8716-6091"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"funder","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rahul Santhanam","raw_affiliation_strings":["University of Edinburgh"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.83,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":8,"citation_normalized_percentile":{"value":0.748841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":83,"max":84},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9999,"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.9999,"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.9984,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9975,"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/constant","display_name":"Constant (computer programming)","score":0.49936604}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.68515503},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.59986746},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.54468244},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5372142},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49936604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48640728},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.473574},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.45371848},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.43744117},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.41847318},{"id":"https://openalex.org/C84655787","wikidata":"https://www.wikidata.org/wiki/Q8067817","display_name":"Compressibility","level":2,"score":0.4119333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31898692},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.17849532},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.14989775},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1376867},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1109893},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.08878362},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2012.74","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://www.pure.ed.ac.uk/ws/files/17928298/Chattopadhyay_Santhanam_2012_Lower_Bounds_on_Interactive_Compressibility_by_Constant_Depth_Circuits.pdf","pdf_url":"https://www.pure.ed.ac.uk/ws/files/17928298/Chattopadhyay_Santhanam_2012_Lower_Bounds_on_Interactive_Compressibility_by_Constant_Depth_Circuits.pdf","source":{"id":"https://openalex.org/S4306400320","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":["University of Edinburgh"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false},{"is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11820/5701c84b-4103-4709-8afa-db56be237d27","pdf_url":"https://www.research.ed.ac.uk/files/17928298/Chattopadhyay_Santhanam_2012_Lower_Bounds_on_Interactive_Compressibility_by_Constant_Depth_Circuits.pdf","source":{"id":"https://openalex.org/S4306400320","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":["University of Edinburgh"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://www.pure.ed.ac.uk/ws/files/17928298/Chattopadhyay_Santhanam_2012_Lower_Bounds_on_Interactive_Compressibility_by_Constant_Depth_Circuits.pdf","pdf_url":"https://www.pure.ed.ac.uk/ws/files/17928298/Chattopadhyay_Santhanam_2012_Lower_Bounds_on_Interactive_Compressibility_by_Constant_Depth_Circuits.pdf","source":{"id":"https://openalex.org/S4306400320","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":["University of Edinburgh"],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":32,"referenced_works":["https://openalex.org/W1527197079","https://openalex.org/W1563465674","https://openalex.org/W1966205523","https://openalex.org/W1980147712","https://openalex.org/W1989274820","https://openalex.org/W1998964055","https://openalex.org/W2008078482","https://openalex.org/W2014593388","https://openalex.org/W2017290750","https://openalex.org/W2036656440","https://openalex.org/W2044021971","https://openalex.org/W2051019379","https://openalex.org/W2060270693","https://openalex.org/W2070678975","https://openalex.org/W2080210666","https://openalex.org/W2091434162","https://openalex.org/W2098225435","https://openalex.org/W2102477571","https://openalex.org/W2103749128","https://openalex.org/W2107284348","https://openalex.org/W2152439289","https://openalex.org/W2165293955","https://openalex.org/W2166292851","https://openalex.org/W2296545821","https://openalex.org/W2340787257","https://openalex.org/W2611609769","https://openalex.org/W27953970","https://openalex.org/W4205582340","https://openalex.org/W4211003473","https://openalex.org/W4298227433","https://openalex.org/W605043455","https://openalex.org/W987035227"],"related_works":["https://openalex.org/W587735977","https://openalex.org/W4388599312","https://openalex.org/W3157395178","https://openalex.org/W2130452840","https://openalex.org/W2053355289","https://openalex.org/W2012983134","https://openalex.org/W1980889844","https://openalex.org/W1980849403","https://openalex.org/W1978142926","https://openalex.org/W1629246812"],"abstract_inverted_index":{"We":[0,24,40,86,97,131],"formulate":[1],"a":[2,15,59,90],"new":[3],"connection":[4,27],"between":[5],"instance":[6,38],"compressibility":[7,152],"[1]),":[8],"where":[9,164],"the":[10,30,54,100,145],"compressor":[11],"uses":[12,58],"circuits":[13,21,163],"from":[14],"class":[16],"C,":[17],"and":[18,66,79,84],"correlation":[19],"with":[20,120,126],"in":[22,52],"C.":[23],"use":[25],"this":[26,133],"to":[28],"prove":[29,144],"first":[31,146],"lower":[32,92,148],"bounds":[33,149],"on":[34],"general":[35],"probabilistic":[36,46],"multi-round":[37,47],"compression.":[39],"show":[41,88],"that":[42,89],"there":[43,112],"is":[44,77,166],"no":[45],"compression":[48,124,137],"protocol":[49],"for":[50,95,107,136,150],"Parity":[51,154],"which":[53,115],"computationally":[55],"bounded":[56],"party":[57],"non-uniform":[60],"AC":[61],"0":[64,161],"-circuit":[65],"transmits":[67],"at":[68],"most":[69],"n/(log(n))":[70],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03c9(1)":[73],"bits.":[74],"This":[75],"result":[76],"tight,":[78],"strengthens":[80],"results":[81],"of":[82,102,123,153],"Dubrov":[83],"Ishai.":[85],"also":[87,98],"similar":[91],"bound":[93],"holds":[94],"Majority.":[96],"consider":[99],"question":[101,134],"round":[103],"separation,":[104],"i.e.,":[105],"whether":[106],"each":[108],"r":[109,121,127],"\u2265":[110],"1,":[111],"are":[113],"functions":[114],"can":[116],"be":[117],"compressed":[118],"better":[119],"rounds":[122],"than":[125],"-":[128],"1":[129],"rounds.":[130],"answer":[132],"affirmatively":[135],"using":[138],"constant-depth":[139],"polynomial-size":[140],"circuits.":[141],"Finally,":[142],"we":[143],"non-trivial":[147],"1-round":[151],"by":[155],"polynomial":[156],"size":[157],"ACC":[158],"[p]":[162],"p":[165],"an":[167],"odd":[168],"prime.":[169]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1996268648","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-02-18T20:37:49.188744","created_date":"2016-06-24"}