{"id":"https://openalex.org/W2163083173","doi":"https://doi.org/10.1007/s00037-007-0235-8","title":"If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances","display_name":"If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W2163083173","doi":"https://doi.org/10.1007/s00037-007-0235-8","mag":"2163083173"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-007-0235-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0235-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0235-8.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":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0235-8.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015086408","display_name":"Dan Gutfreund","orcid":"https://orcid.org/0000-0001-5101-4443"},"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":true,"raw_author_name":"Dan Gutfreund","raw_affiliation_strings":["School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, 02138, USA"],"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"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062263696","display_name":"Ronen Shaltiel","orcid":"https://orcid.org/0000-0002-5182-593X"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ronen Shaltiel","raw_affiliation_strings":["Department of Computer Science, University of Haifa, Haifa, 31905, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Haifa, Haifa, 31905, Israel","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051671028","display_name":"Amnon Ta\u2010Shma","orcid":"https://orcid.org/0000-0001-8186-3622"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amnon Ta-Shma","raw_affiliation_strings":["Department of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015086408"],"corresponding_institution_ids":["https://openalex.org/I136199984"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":2.5775,"has_fulltext":true,"cited_by_count":71,"citation_normalized_percentile":{"value":0.89816292,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"16","issue":"4","first_page":"412","last_page":"441"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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.9991999864578247,"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.9987999796867371,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.6877872943878174},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6860410571098328},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5987269878387451},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5584393739700317},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5561667680740356},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5548240542411804},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4652211666107178},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4270067811012268},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3989759683609009},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38086533546447754},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06371322274208069}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6877872943878174},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6860410571098328},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5987269878387451},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5584393739700317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5561667680740356},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5548240542411804},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4652211666107178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4270067811012268},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3989759683609009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38086533546447754},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06371322274208069},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00037-007-0235-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0235-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0235-8.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-0235-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00037-007-0235-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00037-007-0235-8.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/G6550371215","display_name":null,"funder_award_id":"N00014-04-1-0478","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320321950","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2163083173.pdf","grobid_xml":"https://content.openalex.org/works/W2163083173.grobid-xml"},"referenced_works_count":64,"referenced_works":["https://openalex.org/W126880940","https://openalex.org/W149470655","https://openalex.org/W153576292","https://openalex.org/W271219125","https://openalex.org/W340651184","https://openalex.org/W346875545","https://openalex.org/W1263653547","https://openalex.org/W1525451859","https://openalex.org/W1594883013","https://openalex.org/W1596720500","https://openalex.org/W1901622511","https://openalex.org/W1943330086","https://openalex.org/W1970808997","https://openalex.org/W1972050218","https://openalex.org/W1973874352","https://openalex.org/W1974751157","https://openalex.org/W1977195026","https://openalex.org/W1994790157","https://openalex.org/W1996360405","https://openalex.org/W1996839061","https://openalex.org/W2015281423","https://openalex.org/W2015880590","https://openalex.org/W2021320809","https://openalex.org/W2021652795","https://openalex.org/W2021736779","https://openalex.org/W2028907144","https://openalex.org/W2037426925","https://openalex.org/W2058859323","https://openalex.org/W2062855793","https://openalex.org/W2062965695","https://openalex.org/W2069919161","https://openalex.org/W2074594718","https://openalex.org/W2074876220","https://openalex.org/W2077244027","https://openalex.org/W2082571280","https://openalex.org/W2100008268","https://openalex.org/W2107324709","https://openalex.org/W2107786321","https://openalex.org/W2107993699","https://openalex.org/W2114451680","https://openalex.org/W2117362057","https://openalex.org/W2124619161","https://openalex.org/W2132833941","https://openalex.org/W2132910148","https://openalex.org/W2135456059","https://openalex.org/W2138036903","https://openalex.org/W2142048307","https://openalex.org/W2142565884","https://openalex.org/W2144537400","https://openalex.org/W2152708687","https://openalex.org/W2153417364","https://openalex.org/W2156186849","https://openalex.org/W2161535207","https://openalex.org/W2169690324","https://openalex.org/W2998808137","https://openalex.org/W3021570316","https://openalex.org/W3165549676","https://openalex.org/W4231602742","https://openalex.org/W4232836212","https://openalex.org/W4240147683","https://openalex.org/W4293168393","https://openalex.org/W6609165609","https://openalex.org/W6645690188","https://openalex.org/W6657281060"],"related_works":["https://openalex.org/W830096938","https://openalex.org/W2109606716","https://openalex.org/W2030292806","https://openalex.org/W2189202191","https://openalex.org/W2177346860","https://openalex.org/W1603360336","https://openalex.org/W1903582155","https://openalex.org/W2494523064","https://openalex.org/W2145856894","https://openalex.org/W2943623134"],"abstract_inverted_index":{"We":[0,58],"prove":[1],"that":[2,29,61,66,73,102,113,143,157,179],"if":[3,8,93],"NP":[4,54,128],"$${\\nsubseteq}$$":[5],"BPP,":[6],"i.e.,":[7],"SAT":[9,161],"is":[10,30,46,74,82,104,114,120,129],"worst-case":[11,49],"hard,":[12],"then":[13],"for":[14,32,53,76,87,122],"every":[15],"probabilistic":[16,78,124],"polynomial-time":[17,79,125],"algorithm":[18,37,156,181],"trying":[19],"to":[20,50,159],"decide":[21],"SAT,":[22],"there":[23,67,103],"exists":[24,68],"some":[25],"polynomially":[26],"samplable":[27,71,115],"distribution":[28,72,107],"hard":[31,75,121],"it.":[33],"That":[34],"is,":[35],"the":[36,47,132,140,150,163,180],"often":[38],"errs":[39,182],"on":[40,108,139,183],"inputs":[41],"from":[42],"this":[43,62],"distribution.":[44],"This":[45],"first":[48],"average-case":[51],"reduction":[52],"of":[55,110,146,152,187],"any":[56],"kind.":[57],"stress":[59],"however,":[60],"does":[63],"not":[64,94],"mean":[65],"one":[69,186],"fixed":[70,106],"all":[77,123],"algorithms,":[80],"which":[81],"a":[83,95,105],"pre-requisite":[84],"assumption":[85],"needed":[86],"one-way":[88],"functions":[89],"and":[90,119],"cryptography":[91],"(even":[92],"sufficient":[96],"assumption).":[97],"Nevertheless,":[98],"we":[99,166],"do":[100],"show":[101],"instances":[109],"NP-complete":[111],"languages,":[112],"in":[116,131,162],"quasi-polynomial":[117],"time":[118],"algorithms":[126],"(unless":[127],"easy":[130],"worst":[133,164],"case).":[134],"Our":[135],"results":[136],"are":[137],"based":[138],"following":[141],"lemma":[142],"may":[144],"be":[145],"independent":[147],"interest:":[148],"Given":[149],"description":[151],"an":[153],"efficient":[154],"(probabilistic)":[155],"fails":[158],"solve":[160],"case,":[165],"can":[167],"efficiently":[168],"generate":[169],"at":[170,184],"most":[171],"three":[172],"Boolean":[173],"formulae":[174],"(of":[175],"increasing":[176],"lengths)":[177],"such":[178],"least":[185],"them.":[188]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":27},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}