{"id":"https://openalex.org/W2918876641","doi":"https://doi.org/10.1145/3470863","title":"Sign-rank Can Increase under Intersection","display_name":"Sign-rank Can Increase under Intersection","publication_year":2021,"publication_date":"2021-09-01","ids":{"openalex":"https://openalex.org/W2918876641","doi":"https://doi.org/10.1145/3470863","mag":"2918876641"},"language":"en","primary_location":{"id":"doi:10.1145/3470863","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3470863","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.cwi.nl/pub/31054/31054.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066860235","display_name":"Mark Bun","orcid":"https://orcid.org/0000-0002-5855-8045"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mark Bun","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027137684","display_name":"Nikhil S. Mande","orcid":"https://orcid.org/0000-0002-9520-7340"},"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"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Nikhil S. Mande","raw_affiliation_strings":["CWI, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080601320","display_name":"Justin Thaler","orcid":"https://orcid.org/0009-0009-2234-6225"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Justin Thaler","raw_affiliation_strings":["Georgetown University, Washington, USA"],"affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066860235"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00665522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"13","issue":"4","first_page":"1","last_page":"17"},"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.9998999834060669,"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.9998999834060669,"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.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/T12072","display_name":"Machine Learning and Algorithms","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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7088467478752136},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7071791887283325},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6947263479232788},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.673149049282074},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5835913419723511},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5769281983375549},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5573458671569824},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5489547252655029},{"id":"https://openalex.org/keywords/sign","display_name":"Sign (mathematics)","score":0.5484344959259033},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5406434535980225},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5289133787155151},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5186668634414673},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5052550435066223},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49886417388916016},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.44779160618782043},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4329870641231537},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.42488521337509155},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4239184260368347},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21553531289100647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1487630009651184},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.07307085394859314}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7088467478752136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7071791887283325},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6947263479232788},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.673149049282074},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5835913419723511},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5769281983375549},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5573458671569824},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5489547252655029},{"id":"https://openalex.org/C139676723","wikidata":"https://www.wikidata.org/wiki/Q1193832","display_name":"Sign (mathematics)","level":2,"score":0.5484344959259033},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5406434535980225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5289133787155151},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5186668634414673},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5052550435066223},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49886417388916016},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.44779160618782043},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4329870641231537},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.42488521337509155},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4239184260368347},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21553531289100647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1487630009651184},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.07307085394859314},{"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3470863","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3470863","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:cwi.nl:31054","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/31054","pdf_url":"https://ir.cwi.nl/pub/31054/31054.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computation Theory vol. 13 no. 4","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:cwi.nl:31054","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/31054","pdf_url":"https://ir.cwi.nl/pub/31054/31054.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computation Theory vol. 13 no. 4","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2918876641.pdf","grobid_xml":"https://content.openalex.org/works/W2918876641.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1517311456","https://openalex.org/W1965748471","https://openalex.org/W1981115804","https://openalex.org/W1995897489","https://openalex.org/W2006822886","https://openalex.org/W2008671796","https://openalex.org/W2026103826","https://openalex.org/W2031374990","https://openalex.org/W2072331102","https://openalex.org/W2074760215","https://openalex.org/W2077740213","https://openalex.org/W2110503949","https://openalex.org/W2117822564","https://openalex.org/W2119877753","https://openalex.org/W2120210041","https://openalex.org/W2123750718","https://openalex.org/W2143355494","https://openalex.org/W2547369620","https://openalex.org/W2604847700","https://openalex.org/W2610739693","https://openalex.org/W2793039178","https://openalex.org/W2898737300","https://openalex.org/W2908172499","https://openalex.org/W2963248611","https://openalex.org/W2978517333","https://openalex.org/W3137706500","https://openalex.org/W3198041721","https://openalex.org/W4210720364"],"related_works":["https://openalex.org/W2122747219","https://openalex.org/W1486286946","https://openalex.org/W4387774848","https://openalex.org/W4206232732","https://openalex.org/W2062934582","https://openalex.org/W1556737090","https://openalex.org/W2949308819","https://openalex.org/W4388215614","https://openalex.org/W2089690927","https://openalex.org/W2184601028"],"abstract_inverted_index":{"The":[0],"communication":[1,7,37,50,78,114,146],"class":[2,14,38,140,159,217],"UPP":[3,82,93,113,136,145],"cc":[4,83,94,137],"is":[5,18,32,107,148],"a":[6,21,49,77,121,130,195],"analog":[8],"of":[9,72,141,161,163,183,203,218],"the":[10,34,59,70,73,108,139,157],"Turing":[11],"Machine":[12],"complexity":[13,23,115,171],"PP":[15],".":[16,177],"It":[17],"characterized":[19],"by":[20,118],"matrix-analytic":[22],"measure":[24],"called":[25,28],"sign-rank":[26],"(also":[27],"dimension":[29,170],"complexity),":[30],"and":[31,68,92,186],"essentially":[33],"most":[35],"powerful":[36],"against":[39],"which":[40],"we":[41],"know":[42],"how":[43],"to":[44,193,214],"prove":[45],"lower":[46],"bounds.":[47],"For":[48],"problem":[51,79],"f":[52,55,57,63,80,85,96,98],",":[53,138],"let":[54],"\u2227":[56,97],"denote":[58],"function":[60,158],"that":[61,112,135,156],"evaluates":[62],"on":[64,166],"two":[65,164],"disjoint":[66],"inputs":[67],"outputs":[69],"AND":[71],"results.":[74],"We":[75,126],"exhibit":[76],"with":[81,143],"(":[84,95],")":[86,99,176],"=":[87,100],"O":[88],"(log":[89,102],"n":[90,104,167,172,175],"),":[91],"\u0398":[101],"2":[103],").":[105],"This":[106,178],"first":[109,131],"result":[110,154],"showing":[111,134],"can":[116],"increase":[117],"more":[119],"than":[120],"constant":[122],"factor":[123],"under":[124,151],"intersection.":[125,152],"view":[127],"this":[128,216],"as":[129],"step":[132],"toward":[133],"problems":[142],"polylogarithmic-cost":[144],"protocols,":[147],"not":[149],"closed":[150],"Our":[153],"shows":[155],"consisting":[160],"intersections":[162,202],"majorities":[165],"bits":[168],"has":[169],"Omega":[173],"\u03a9(log":[174],"matches":[179],"an":[180],"upper":[181],"bound":[182],"(Klivans,":[184],"O\u2019Donnell,":[185],"Servedio,":[187],"FOCS":[188],"2002),":[189],"who":[190],"used":[191],"it":[192],"give":[194],"quasipolynomial":[196],"time":[197],"algorithm":[198],"for":[199],"PAC":[200],"learning":[201],"polylogarithmically":[204],"many":[205],"majorities.":[206],"Hence,":[207],"fundamentally":[208],"new":[209],"techniques":[210],"will":[211],"be":[212],"needed":[213],"learn":[215],"functions":[219],"in":[220],"polynomial":[221],"time.":[222]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}