{"id":"https://openalex.org/W1994699532","doi":"https://doi.org/10.1137/130973429","title":"Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010)","display_name":"Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010)","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1994699532","doi":"https://doi.org/10.1137/130973429","mag":"1994699532"},"language":"en","primary_location":{"id":"doi:10.1137/130973429","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130973429","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/A5086535374","display_name":"Chris Peikert","orcid":"https://orcid.org/0000-0003-0419-7501"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chris Peikert","raw_affiliation_strings":["Electrical Engineering and Computer Science - Computer Science and Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science - Computer Science and Engineering","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079103282","display_name":"Robert Kleinberg","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Kleinberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alan Frieze","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088846595","display_name":"Alexander Russell","orcid":"https://orcid.org/0000-0002-8228-6238"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander Russell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5065859226","display_name":"Leonard J. Schulman","orcid":"https://orcid.org/0000-0001-9901-2797"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leonard Schulman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07441633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"42","issue":"3","first_page":"1216","last_page":"1217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9915000200271606,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9915000200271606,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9896000027656555,"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.9611999988555908,"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.5826809406280518},{"id":"https://openalex.org/keywords/section","display_name":"Section (typography)","score":0.543236255645752},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48772820830345154},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3977311849594116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3673660159111023},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.32581356167793274}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5826809406280518},{"id":"https://openalex.org/C2780129039","wikidata":"https://www.wikidata.org/wiki/Q1931107","display_name":"Section (typography)","level":2,"score":0.543236255645752},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48772820830345154},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3977311849594116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3673660159111023},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.32581356167793274},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/130973429","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130973429","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2560853036","https://openalex.org/W2566696415","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W4249026152"],"abstract_inverted_index":{"This":[0,219,250],"issue":[1,662],"of":[2,16,45,94,113,121,184,231,236,263,326,338,404,408,419,428,452,468,593,617,632],"SICOMP":[3],"contains":[4],"eight":[5],"selected":[6,37],"papers":[7,97],"from":[8,38,245,342,603,620],"the":[9,34,95,108,114,150,182,185,202,213,261,264,273,304,324,393,402,417,434,469,493,498,521,533,587,594,628,640,642,646,651],"Forty-Second":[10],"Annual":[11],"ACM":[12],"Symposium":[13],"on":[14,179,233,260,483],"Theory":[15],"Computing":[17],"(STOC":[18],"2010),":[19],"held":[20],"June":[21],"6--8,":[22],"2010,":[23],"in":[24,99,140,187,272,277,301,398,543,548,568,574,586,599],"Cambridge,":[25],"Massachusetts.":[26],"The":[27,41,266],"STOC":[28,96,643,647],"proceedings":[29],"contained":[30],"78":[31],"papers,":[32],"which":[33,145,371],"program":[35,42,644],"committee":[36,43],"279":[39],"submissions.":[40],"consisted":[44],"Timothy":[46],"Chan,":[47],"Ken":[48],"Clarkson,":[49],"Constantinos":[50],"Daskalakis,":[51],"Irit":[52],"Dinur,":[53],"Faith":[54],"Ellen,":[55],"Alan":[56],"Frieze,":[57],"Parikshit":[58],"Gopalan,":[59],"Piotr":[60],"Indyk,":[61],"Valentine":[62],"Kabanets,":[63],"Yael":[64],"Tauman":[65],"Kalai,":[66],"Howard":[67],"Karloff,":[68],"Robert":[69],"Kleinberg,":[70],"Assaf":[71],"Naor,":[72],"Noam":[73],"Nisan,":[74],"Chris":[75],"Peikert,":[76],"Jaikumar":[77],"Radhakrishnan,":[78],"Oded":[79],"Regev,":[80],"Alexander":[81],"Russell,":[82],"Leonard":[83],"Schulman":[84],"(chair),":[85],"Aravind":[86],"Srinivasan,":[87],"Santosh":[88],"Vempala,":[89],"and":[90,105,142,165,209,295,336,347,354,362,389,440,489,503,556,590,610,626,636,650],"Andrew":[91],"Yao.":[92],"Eight":[93],"appear":[98],"this":[100,660],"special":[101,661],"section,":[102],"each":[103,270],"expanded":[104],"subjected":[106],"to":[107,227,254,329,379,658],"standard":[109,189],"thorough":[110],"reviewing":[111],"process":[112],"journal.":[115],"They":[116],"cover":[117],"a":[118,193,229,234,239,242,246,256,409,425,517,560,565,569,614],"diverse":[119],"collection":[120],"topics:":[122],"In":[123,197,286,333,377,471,540,596],"\u201cImproving":[124],"Exhaustive":[125],"Search":[126],"Implies":[127],"Superpolynomial":[128],"Lower":[129],"Bounds,\"":[130],"R.":[131],"Ryan":[132],"Williams":[133,169],"shows":[134],"that":[135,147,269,448,563,582,623],"there":[136,225],"are":[137,226,317],"natural":[138],"problems":[139],"NP":[141],"BPP":[143],"for":[144,177,201,289,309,357,366,431,478,497,520,537,654],"algorithms":[146,356,365,496],"improve":[148],"over":[149,532],"na\u00efve":[151],"deterministic":[152,518],"simulation":[153],"even":[154],"quite":[155],"slightly,":[156],"imply":[157],"lower":[158,175],"bounds":[159,176,536],"such":[160],"as":[161,461,464],"NEXP":[162],"$\\not\\in$":[163],"P/poly":[164],"LOGSPACE":[166],"$\\neq$":[167],"NP.":[168],"also":[170,318],"proves":[171],"certain":[172],"unconditional":[173],"time-space":[174],"improving":[178],"exhaustive":[180],"search;":[181],"length":[183],"witness-string":[186],"some":[188],"verification":[190],"protocol":[191,443],"is":[192,241,252,268,276,280,323,401,529,591],"key":[194,321],"parameter":[195],"here.":[196],"\u201cAn":[198],"Effective":[199],"Dichotomy":[200],"Counting":[203],"Constraint":[204],"Satisfaction":[205],"Problem,\"":[206],"Martin":[207],"Dyer":[208],"David":[210,296],"Richerby":[211],"consider":[212],"counting":[214],"constraint":[215,240],"satisfaction":[216],"problem":[217,220,271,397,501,507,524],"(\\#CSP).":[218],"asks":[221],"how":[222],"many":[223,302,462],"ways":[224],"satisfy":[228],"system":[230],"constraints":[232],"set":[235],"variables,":[237],"where":[238],"relation":[243],"chosen":[244],"fixed":[247],"finite":[248],"set.":[249],"class":[251,274],"shown":[253],"have":[255],"decidable":[257],"dichotomy,":[258],"depending":[259],"form":[262],"relations.":[265],"dichotomy":[267],"either":[275],"FP":[278],"or":[279],"\\#P-complete,":[281],"with":[282],"no":[283],"intermediate":[284],"cases.":[285],"\u201cPseudorandom":[287],"Generators":[288,602],"Polynomial":[290],"Threshold":[291],"Functions,\"":[292,605],"Raghu":[293],"Meka":[294],"Zuckerman":[297],"develop":[298],"improved":[299],"(and":[300],"cases":[303],"first":[305,494],"nontrivial)":[306],"pseudorandom":[307,331,618],"generators":[308,619],"low-degree":[310],"polynomial":[311],"threshold":[312],"functions;":[313],"related":[314],"explicit":[315],"constructions":[316],"developed.":[319],"A":[320],"ingredient":[322],"use":[325],"invariance":[327],"principles":[328],"construct":[330],"generators.":[332],"\u201cLocal":[334],"List-Decoding":[335],"Testing":[337],"Random":[339],"Linear":[340],"Codes":[341],"High":[343],"Error,\"":[344],"Swastik":[345],"Kopparty":[346],"Shubhangi":[348],"Saraf":[349],"give":[350,613],"efficient":[351],"local":[352],"list-decoding":[353,367],"testing":[355],"\u201csparse\"":[358],"random":[359,368],"linear":[360,369],"codes,":[361,370],"subexponential":[363],"time":[364,575,581],"tolerate":[372],"error":[373],"rates":[374],"approaching":[375],"$1/2$.":[376],"\u201cHow":[378],"Compress":[380],"Interactive":[381],"Communication,\"":[382],"Boaz":[383],"Barak,":[384],"Mark":[385],"Braverman,":[386],"Xi":[387],"Chen,":[388],"Anup":[390],"Rao":[391],"attack":[392],"important":[394],"direct":[395],"sum":[396],"communication":[399],"complexity:":[400],"complexity":[403,418],"evaluating":[405,420],"$n$":[406,415,450],"copies":[407,451],"function":[410,454],"ever":[411],"significantly":[412],"less":[413],"than":[414],"times":[416,460],"it":[421],"once?":[422],"By":[423],"defining":[424],"new":[426,442,615],"notion":[427],"information":[429,437],"cost":[430,438],"protocols":[432],"---":[433,439],"so-called":[435],"internal":[436],"providing":[441],"compression":[444],"schemes,":[445],"they":[446,515],"prove":[447],"computing":[449,465],"any":[453],"requires":[455],"communicating":[456],"at":[457],"least":[458],"$\\sqrt{n}$":[459],"bits":[463],"one":[466],"copy":[467],"function.":[470],"\u201cA":[472],"Deterministic":[473],"Single":[474],"Exponential":[475],"Time":[476,547],"Algorithm":[477],"Most":[479],"Lattice":[480],"Problems":[481],"based":[482],"Voronoi":[484],"Cell":[485],"Computations,\"":[486],"Daniele":[487],"Micciancio":[488],"Panagiotis":[490],"Voulgaris":[491],"provide":[492,516,559],"$\\exp(O(n))$-time":[495],"closest":[499],"vector":[500,523],"(CVP)":[502],"shortest":[504,522],"independent":[505,592],"vectors":[506],"(SIVP);":[508],"their":[509,656],"algorithm":[510,519,562],"is,":[511],"moreover,":[512],"deterministic.":[513],"Likewise":[514],"(SVP),":[525],"whose":[526],"$\\exp(O(n))$":[527],"runtime":[528],"an":[530],"improvement":[531],"best":[534],"known":[535],"randomized":[538,561],"algorithms.":[539],"\u201cPerfect":[541],"Matchings":[542],"$O(n":[544,576],"\\log":[545,577],"n)$":[546],"Regular":[549],"Bipartite":[550],"Graphs,\"":[551],"Ashish":[552],"Goel,":[553],"Michael":[554],"Kapralov,":[555],"Sanjeev":[557],"Khanna":[558],"finds":[564],"perfect":[566],"matching":[567],"$d$-regular":[570],"$n$-node":[571],"bipartite":[572],"graph":[573],"n)$,":[578],"notably,":[579],"within":[580],"may":[583],"be":[584],"sublinear":[585],"input":[588],"size":[589],"degree.":[595],"\u201cEfficiency":[597],"Improvements":[598],"Constructing":[600],"Pseudorandom":[601],"One-Way":[604],"Iftach":[606],"Haitner,":[607],"Omer":[608],"Reingold,":[609],"Salil":[611],"Vadhan":[612],"construction":[616,631],"one-way":[621],"functions":[622],"both":[624],"simplifies":[625],"tightens":[627],"acclaimed":[629],"original":[630],"Hastad,":[633],"Impagliazzo,":[634],"Levin,":[635],"Luby.":[637],"We":[638],"thank":[639],"authors,":[641],"committee,":[645],"external":[648],"reviewers,":[649],"journal":[652],"referees":[653],"all":[655],"work":[657],"make":[659],"possible.":[663]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}