{"id":"https://openalex.org/W2515883226","doi":"https://doi.org/10.1137/16n974127","title":"Special Section on the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012)","display_name":"Special Section on the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012)","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2515883226","doi":"https://doi.org/10.1137/16n974127","mag":"2515883226"},"language":"en","primary_location":{"id":"doi:10.1137/16n974127","is_oa":true,"landing_page_url":"https://doi.org/10.1137/16n974127","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/16N974127","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":true,"oa_status":"bronze","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/16N974127","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020848377","display_name":"Andrew McGregor","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andrew McGregor","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085864294","display_name":"Rahul Santhanam","orcid":"https://orcid.org/0000-0002-8716-6091"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rahul Santhanam","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020848377"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09707422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"45","issue":"4","first_page":"1448","last_page":"1449"},"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.9994000196456909,"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.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/T11567","display_name":"semigroups and automata theory","score":0.9961000084877014,"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/combinatorics","display_name":"Combinatorics","score":0.5514041185379028},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5125241279602051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4674789607524872},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38990968465805054},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3722994923591614}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5514041185379028},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5125241279602051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4674789607524872},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38990968465805054},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3722994923591614},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16n974127","is_oa":true,"landing_page_url":"https://doi.org/10.1137/16n974127","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/16N974127","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":{"id":"doi:10.1137/16n974127","is_oa":true,"landing_page_url":"https://doi.org/10.1137/16n974127","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/16N974127","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2515883226.pdf","grobid_xml":"https://content.openalex.org/works/W2515883226.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"This":[0],"issue":[1],"of":[2,17,48,70,76,129,145,159,194,201,205,226,238,369,394],"SICOMP":[3],"contains":[4],"seven":[5],"specially":[6],"selected":[7,125],"papers":[8,35,53,127,136],"from":[9],"the":[10,42,45,49,60,65,135,156,160,202,229,269,283,334,339,367,421,480,483,494,503],"Forty-Fourth":[11],"Annual":[12],"ACM":[13],"Symposium":[14],"on":[15,155,212,292],"Theory":[16],"Computing,":[18],"otherwise":[19],"known":[20,171],"as":[21],"STOC":[22,50],"2012,":[23],"held":[24],"May":[25],"19":[26],"to":[27,39,64,342,430],"22":[28],"in":[29,177,275,380,405,499],"New":[30,32],"York,":[31],"York.":[33],"The":[34,52,72,215],"here":[36],"were":[37,170],"chosen":[38],"represent":[40],"both":[41],"excellence":[43],"and":[44,57,62,121,254,265,287,299,324,363,417,441,453,465,473,482,490,501],"broad":[46],"range":[47],"program.":[51],"have":[54],"been":[55],"revised":[56],"extended":[58],"by":[59],"authors":[61,481],"subjected":[63],"standard":[66],"thorough":[67],"reviewing":[68],"process":[69],"SICOMP.":[71],"program":[73,484],"committee":[74,485],"consisted":[75],"Richard":[77],"Cleve,":[78],"Parikshit":[79],"Gopalan,":[80],"Jason":[81],"Hartline,":[82],"Tom":[83],"Hayes,":[84],"Anna":[85],"Karlin,":[86],"Sanjeev":[87,357],"Khanna,":[88],"Andrew":[89],"McGregor,":[90],"Rina":[91],"Panigrahy,":[92],"Toniann":[93],"Pitassi,":[94],"Ran":[95],"Raz,":[96],"Charles":[97],"Rackoff,":[98],"Satish":[99],"Rao,":[100],"Oded":[101],"Regev,":[102],"Dana":[103],"Ron,":[104],"Guy":[105],"Rothblum,":[106],"Amin":[107],"Saberi,":[108],"Rahul":[109],"Santhanam,":[110],"Shubhangi":[111],"Saraf,":[112],"Daniel":[113],"Spielman,":[114],"Madhur":[115],"Tulsiani,":[116],"Suresh":[117],"Venkatasubramanian,":[118],"Avi":[119],"Wigderson,":[120],"David":[122],"Williamson.":[123],"They":[124,278,386],"90":[126],"out":[128],"303":[130],"submissions.":[131],"We":[132,478],"briefly":[133],"describe":[134],"that":[137,208,285,428,448,456],"appear":[138],"here.":[139],"In":[140,175,242,308,351,402,433],"\u201cThe":[141,309],"Multiparty":[142],"Communication":[143],"Complexity":[144],"Set":[146],"Disjointness,\u201d":[147],"Alexander":[148],"Sherstov":[149],"presents":[150,185],"an":[151,186,280,328,343,377],"$\\Omega(n/4^k)^{1/4}$":[152],"lower":[153,168,306],"bound":[154],"communication":[157],"complexity":[158],"$k$-party":[161],"set":[162,193],"disjointness":[163],"problem.":[164],"Previously,":[165],"no":[166],"polynomial":[167,293],"bounds":[169],"for":[172,250,303,333,390,410,425,486,496],"$k=\\omega(1)$":[173],"players.":[174],"\u201cRouting":[176],"Undirected":[178],"Graphs":[179],"with":[180,347,397],"Constant":[181],"Congestion,\u201d":[182],"Julia":[183],"Chuzhoy":[184],"efficient":[187,329,388],"randomized":[188,330],"algorithm":[189,233,332],"that,":[190],"given":[191],"a":[192,198,223,239,315,353,371,398,457],"demand":[195,206],"pairs,":[196],"routes":[197],"polylogarithmic":[199,236],"fraction":[200],"maximum":[203],"number":[204,225],"pairs":[207],"could":[209],"be":[210],"routed":[211],"edge-disjoint":[213],"paths.":[214],"routing":[216],"returned":[217],"uses":[218],"each":[219],"edge":[220],"at":[221],"most":[222],"constant":[224],"times,":[227],"whereas":[228],"best":[230,232],"previous":[231,290],"guaranteed":[234],"only":[235,466],"reuse":[237],"single":[240],"edge.":[241],"\u201cJacobian":[243],"Hits":[244],"Circuits:":[245],"Hitting":[246],"Sets,":[247],"Lower":[248,408],"Bounds":[249,409],"Depth-$D$":[251],"Occur-$k$":[252],"Formulas":[253],"Depth-$3$":[255],"Transcendence":[256],"Degree-$k$":[257],"Circuits,\u201d":[258],"Manindra":[259],"Agrawal,":[260],"Chandan":[261],"Saha,":[262],"Ramprasad":[263],"Saptharishi,":[264],"Nitin":[266],"Saxena":[267],"study":[268],"black":[270,295],"box":[271,296],"identity":[272,297],"testing":[273,298],"problem":[274,337,368,379,460],"arithmetic":[276],"complexity.":[277],"present":[279,327,387],"approach":[281],"using":[282],"Jacobian":[284],"unifies":[286],"generalizes":[288],"several":[289],"results":[291],"time":[294],"is":[300,461],"also":[301],"useful":[302],"proving":[304],"circuit":[305],"bounds.":[307],"Traveling":[310],"Salesman":[311],"Problem:":[312],"Low-Dimensionality":[313],"Implies":[314],"Polynomial":[316],"Time":[317],"Approximation":[318],"Scheme,\u201d":[319],"Yair":[320],"Bartal,":[321],"Lee-Ad":[322],"Gottlieb,":[323],"Robert":[325],"Krauthgamer":[326],"$(1+\\epsilon)$-approximation":[331],"traveling":[335],"salesman":[336],"when":[338],"distances":[340],"correspond":[341],"arbitrary":[344],"metric":[345],"space":[346],"bounded":[348,470],"intrinsic":[349],"dimension.":[350],"\u201cComputing":[352],"Nonnegative":[354],"Matrix":[355],"Factorization---Provably,\u201d":[356],"Arora,":[358],"Rong":[359],"Ge,":[360],"Ravi":[361],"Kannan,":[362],"Ankur":[364],"Moitra":[365],"investigate":[366],"factorizing":[370],"matrix":[372],"into":[373],"two":[374],"nonnegative":[375],"matrices,":[376,395],"important":[378],"machine":[381],"learning,":[382],"among":[383],"other":[384],"areas.":[385],"algorithms":[389],"certain":[391],"natural":[392],"families":[393],"along":[396],"complementary":[399],"hardness":[400],"result.":[401],"\u201cTime-Space":[403],"Trade-offs":[404],"Resolution:":[406],"Superpolynomial":[407],"Superlinear":[411],"Space,\u201d":[412],"Paul":[413],"Beame,":[414],"Chris":[415],"Beck,":[416],"Russell":[418],"Impagliazzo":[419],"give":[420],"first":[422],"size-space":[423],"tradeoffs":[424],"resolution":[426],"proofs":[427],"apply":[429],"superlinear":[431],"space.":[432],"\u201cRobustly":[434],"Solvable":[435],"Constraint":[436],"Satisfaction":[437],"Problems,\u201d":[438],"Libor":[439],"Barto":[440,472],"Marcin":[442],"Kozik":[443,474],"characterize":[444],"constraint":[445,458],"satisfaction":[446,459],"problems":[447],"are":[449],"robustly":[450,462],"satisfiable.":[451],"Guruswami":[452],"Zhou":[454],"conjectured":[455],"satisfiable":[463],"if":[464,467],"it":[468],"has":[469],"width.":[471],"confirm":[475],"this":[476],"conjecture.":[477],"thank":[479,493],"their":[487,497],"hard":[488],"work,":[489],"we":[491],"especially":[492],"reviewers":[495],"work":[498],"evaluating":[500],"improving":[502],"submitted":[504],"papers.":[505]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}