{"id":"https://openalex.org/W2482830260","doi":"https://doi.org/10.1137/15m1031862","title":"Upper and Lower Bounds on the Power of Advice","display_name":"Upper and Lower Bounds on the Power of Advice","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2482830260","doi":"https://doi.org/10.1137/15m1031862","mag":"2482830260"},"language":"en","primary_location":{"id":"doi:10.1137/15m1031862","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1031862","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5088854880","display_name":"Arkadev Chattopadhyay","orcid":"https://orcid.org/0009-0005-3110-3584"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Arkadev Chattopadhyay","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110260911","display_name":"Jeff Edmonds","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jeff Edmonds","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013813328","display_name":"Faith Ellen","orcid":"https://orcid.org/0000-0003-4473-931X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Faith Ellen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5003318200","display_name":"Toniann Pitassi","orcid":"https://orcid.org/0000-0002-8668-2174"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toniann Pitassi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5088854880"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.28187688,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.82262427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"45","issue":"4","first_page":"1412","last_page":"1432"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9997000098228455,"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/T10237","display_name":"Cryptography and Data Security","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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/logarithm","display_name":"Logarithm","score":0.643230140209198},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6319987177848816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6076700091362},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6050297021865845},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5950578451156616},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5304206013679504},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.5269171595573425},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5099965333938599},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49144041538238525},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47444236278533936},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.45160213112831116},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.440976083278656},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.42366060614585876},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4186331033706665},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4186108112335205},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.41783231496810913},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39637914299964905},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3324905037879944}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.643230140209198},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6319987177848816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6076700091362},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6050297021865845},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5950578451156616},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5304206013679504},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.5269171595573425},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5099965333938599},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49144041538238525},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47444236278533936},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.45160213112831116},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.440976083278656},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.42366060614585876},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4186331033706665},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4186108112335205},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.41783231496810913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39637914299964905},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3324905037879944},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","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},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m1031862","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1031862","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W88251305","https://openalex.org/W1500866162","https://openalex.org/W1506973466","https://openalex.org/W1520252399","https://openalex.org/W1805653176","https://openalex.org/W1909754222","https://openalex.org/W1963524245","https://openalex.org/W1970169765","https://openalex.org/W1972068724","https://openalex.org/W1980223785","https://openalex.org/W1988508518","https://openalex.org/W1993022201","https://openalex.org/W2002501531","https://openalex.org/W2006787007","https://openalex.org/W2023930099","https://openalex.org/W2039831869","https://openalex.org/W2042753471","https://openalex.org/W2070486524","https://openalex.org/W2080995342","https://openalex.org/W2088263428","https://openalex.org/W2089620427","https://openalex.org/W2089797683","https://openalex.org/W2098207812","https://openalex.org/W2107917944","https://openalex.org/W2120210041","https://openalex.org/W2129700748","https://openalex.org/W2151303208","https://openalex.org/W2154904274","https://openalex.org/W2176265082","https://openalex.org/W2266371753","https://openalex.org/W2340006107","https://openalex.org/W2340787257","https://openalex.org/W2963834565","https://openalex.org/W3157388067","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2036758175","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W1994598067","https://openalex.org/W2963903795","https://openalex.org/W3097369619","https://openalex.org/W2008470896","https://openalex.org/W2061496873","https://openalex.org/W4377371889","https://openalex.org/W3119911731"],"abstract_inverted_index":{"Proving":[0],"superpolylogarithmic":[1],"lower":[2,218,253,262],"bounds":[3,219,240,254],"for":[4,22,79,134,167,227],"dynamic":[5,66,277],"data":[6,67,278],"structures":[7,279],"has":[8],"remained":[9],"an":[10,19,52],"open":[11],"problem":[12,49,82,94],"despite":[13],"years":[14],"of":[15,41,50,55,64,92,201,224,237,249,251,259,276],"research.":[16],"P\u01cetra\u015fcu":[17],"proposed":[18],"exciting":[20],"approach":[21],"breaking":[23],"this":[24,108,225],"barrier":[25],"via":[26],"a":[27,61,164,175,211,246,256,260],"two-player":[28],"communication":[29,87,128,156,199],"model":[30,59,141,173,205,226],"in":[31,57,70,83,97,130,139,158,171,178,203,220],"which":[32,135,151],"one":[33,250],"player":[34],"gets":[35],"private":[36],"advice":[37,104],"at":[38],"the":[39,42,48,71,84,89,93,131,136,159,168,195,265,268,272],"beginning":[40],"protocol.":[43],"He":[44,75],"gave":[45],"reductions":[46],"from":[47],"solving":[51],"asymmetric":[53,90,137,169],"version":[54,91,170],"set-disjointness":[56,232],"his":[58,98,116,140,172,204],"to":[60,242],"diverse":[62],"collection":[63],"natural":[65,228],"structure":[68],"problems":[69,202],"cell":[72],"probe":[73],"model.":[74,117],"also":[76,152,216],"conjectured":[77],"that,":[78],"any":[80],"hard":[81,96],"standard":[85],"two-party":[86,132,160],"model,":[88,99,133,161],"is":[95,105,188],"provided":[100],"not":[101],"too":[102],"much":[103],"given.":[106],"In":[107,190],"paper,":[109],"we":[110,162,192],"prove":[111,217],"several":[112],"surprising":[113],"results":[114,181],"about":[115],"We":[118,215],"show":[119,193],"that":[120,183,194],"there":[121],"exist":[122],"Boolean":[123],"functions":[124,229],"requiring":[125],"linear":[126,154],"randomized":[127,155,196],"complexity":[129,157],"versions":[138,223],"have":[142],"deterministic":[143,165,198],"protocols":[144],"with":[145,174,280],"exponentially":[146],"smaller":[147],"complexity.":[148,179],"For":[149],"set-disjointness,":[150],"requires":[153],"give":[163],"protocol":[166],"quadratic":[176],"improvement":[177],"These":[180],"demonstrate":[182],"P\u01cetra\u015fcu's":[184],"conjecture,":[185],"as":[186,231],"stated,":[187],"false.":[189],"addition,":[191],"and":[197,233,271],"complexities":[200],"differ":[206],"by":[207],"no":[208],"more":[209],"than":[210],"logarithmic":[212],"multiplicative":[213],"factor.":[214],"some":[221],"restricted":[222],"such":[230],"inner":[234],"product.":[235],"All":[236],"our":[238],"upper":[239],"conform":[241],"these":[243,252],"restrictions.":[244],"Moreover,":[245],"special":[247],"case":[248],"implies":[255],"new":[257],"proof":[258],"strong":[261],"bound":[263],"on":[264],"tradeoff":[266],"between":[267],"query":[269,282],"time":[270,275],"amortized":[273],"update":[274],"nonadaptive":[281],"algorithms.":[283]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}