{"id":"https://openalex.org/W2036825038","doi":"https://doi.org/10.1007/s00037-007-0232-y","title":"Special Issue On Worst-case Versus Average-case Complexity Editors\u2019 Foreword","display_name":"Special Issue On Worst-case Versus Average-case Complexity Editors\u2019 Foreword","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W2036825038","doi":"https://doi.org/10.1007/s00037-007-0232-y","mag":"2036825038"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-007-0232-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0232-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0232-y.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"editorial","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0232-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013698877","display_name":"Oded Goldreich","orcid":"https://orcid.org/0000-0002-4329-135X"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Oded Goldreich","raw_affiliation_strings":["Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel","[Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"[Department of Computer Science, Weizmann Institute of Science, Rehovot, Israel]","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016656677","display_name":"Salil Vadhan","orcid":"https://orcid.org/0000-0002-4059-4072"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Salil Vadhan","raw_affiliation_strings":["School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, 02138, USA","School of Engineering and Applied Sciences, Harvard University, Cambridge, USA 02138"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, 02138, USA","institution_ids":["https://openalex.org/I136199984"]},{"raw_affiliation_string":"School of Engineering and Applied Sciences, Harvard University, Cambridge, USA 02138","institution_ids":["https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013698877"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":null,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"4","first_page":"325","last_page":"330"},"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.9997000098228455,"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.9997000098228455,"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.9987000226974487,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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/computer-science","display_name":"Computer science","score":0.6687410473823547},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.6366664171218872},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5777347683906555},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"Average-case complexity","score":0.5020475387573242},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.44678959250450134},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4270779490470886},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.4179304242134094},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.41255348920822144},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4111464321613312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2073894441127777},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17450806498527527}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6687410473823547},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.6366664171218872},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5777347683906555},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.5020475387573242},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.44678959250450134},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4270779490470886},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.4179304242134094},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.41255348920822144},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4111464321613312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2073894441127777},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17450806498527527}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00037-007-0232-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0232-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0232-y.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00037-007-0232-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0232-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0232-y.pdf","source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G286214036","display_name":"CAREER: A Unified Theory of Pseudorandomness","funder_award_id":"0133096","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5027236504","display_name":"New Complexity-Theoretic Techniques in Cryptography","funder_award_id":"0430336","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2036825038.pdf","grobid_xml":"https://content.openalex.org/works/W2036825038.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W269259546","https://openalex.org/W271219125","https://openalex.org/W340651184","https://openalex.org/W346875545","https://openalex.org/W1263653547","https://openalex.org/W1590403016","https://openalex.org/W1593251595","https://openalex.org/W1594962164","https://openalex.org/W1596412683","https://openalex.org/W1596720500","https://openalex.org/W1788833175","https://openalex.org/W1901622511","https://openalex.org/W1972050218","https://openalex.org/W1974964982","https://openalex.org/W1994790157","https://openalex.org/W2021736779","https://openalex.org/W2028838286","https://openalex.org/W2048284438","https://openalex.org/W2051176401","https://openalex.org/W2058859323","https://openalex.org/W2062855793","https://openalex.org/W2062965695","https://openalex.org/W2077244027","https://openalex.org/W2097206148","https://openalex.org/W2100008268","https://openalex.org/W2107324709","https://openalex.org/W2112962375","https://openalex.org/W2134839489","https://openalex.org/W2142048307","https://openalex.org/W2153417364","https://openalex.org/W2156369551","https://openalex.org/W2161714146","https://openalex.org/W2169690324","https://openalex.org/W2180929963","https://openalex.org/W2186793764","https://openalex.org/W2275958883","https://openalex.org/W2952328150","https://openalex.org/W4240147683","https://openalex.org/W4256317935","https://openalex.org/W6609165609","https://openalex.org/W6634282922","https://openalex.org/W6638163778","https://openalex.org/W6683469430"],"related_works":["https://openalex.org/W1512399864","https://openalex.org/W2327776271","https://openalex.org/W2374430960","https://openalex.org/W1988772559","https://openalex.org/W2461808546","https://openalex.org/W2041069649","https://openalex.org/W342214647","https://openalex.org/W2990853482","https://openalex.org/W2047754121","https://openalex.org/W1548964214"],"abstract_inverted_index":{"Average-case":[0],"complexity,":[1,120],"which":[2],"examines":[3],"the":[4,39,47,103,113,162],"tractability":[5],"of":[6,81,84,156,161,165],"computational":[7],"problems":[8,130],"on":[9,134,144],"\u2018random":[10],"instances,\u2019":[11],"is":[12,96,110],"a":[13,31,79,153],"major":[14],"topic":[15],"in":[16,44,88,102],"complexity":[17,37,86,117],"theory":[18],"with":[19,53],"at":[20],"least":[21],"two":[22,73],"distinct":[23],"motivations.":[24],"On":[25,46],"one":[26],"hand,":[27,49],"it":[28,50],"may":[29],"provide":[30],"more":[32,107],"realistic":[33],"model":[34],"than":[35],"worst-case":[36,119],"for":[38,64,100],"problem":[40],"instances":[41],"actually":[42,76],"encountered":[43],"practice.":[45],"other":[48],"provides":[51],"us":[52,60],"methods":[54],"to":[55,61,111,151],"generate":[56],"hard":[57,133],"instances,":[58],"allowing":[59],"harness":[62],"intractability":[63],"useful":[65],"ends":[66],"such":[67],"as":[68],"cryptography":[69],"and":[70,92,118],"derandomization.":[71],"These":[72],"motivations":[74],"are":[75,132,159],"supported":[77],"by":[78],"variety":[80],"different":[82,163],"notions":[83,95],"average-case":[85,116],"(surveyed":[87],"[17,":[89],"13,":[90],"6])":[91],"relating":[93],"these":[94],"an":[97],"important":[98],"direction":[99],"research":[101],"area.":[104],"An":[105],"even":[106],"ambitious":[108],"goal":[109],"understand":[112],"relationship":[114],"between":[115],"e.g.,":[121],"whether":[122],"NP":[123,128],"=":[124],"P":[125],"implies":[126],"that":[127,131,158,167],"has":[129,140],"average.":[135],"In":[136],"recent":[137],"years,":[138],"there":[139],"been":[141,169],"substantial":[142],"progress":[143],"this":[145],"front.":[146],"This":[147],"special":[148],"issue":[149],"aims":[150],"present":[152],"small":[154],"sample":[155],"papers":[157],"representative":[160],"types":[164],"results":[166],"have":[168],"obtained:":[170]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}