{"id":"https://openalex.org/W2407363631","doi":"https://doi.org/10.1137/s0097539705447281","title":"Using Nondeterminism to Amplify Hardness","display_name":"Using Nondeterminism to Amplify Hardness","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2407363631","doi":"https://doi.org/10.1137/s0097539705447281","mag":"2407363631"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539705447281","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705447281","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":true,"oa_status":"green","oa_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467485","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073397662","display_name":"Alexander Healy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander Healy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016656677","display_name":"Salil Vadhan","orcid":"https://orcid.org/0000-0002-4059-4072"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Salil Vadhan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072846764","display_name":"Emanuele Viola","orcid":"https://orcid.org/0000-0001-6091-1824"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Emanuele Viola","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.32230326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"4","first_page":"903","last_page":"931"},"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.9975000023841858,"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.9975000023841858,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9735999703407288,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9718000292778015,"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/omega","display_name":"Omega","score":0.8904473781585693},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7511414885520935},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5385374426841736},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.5062488913536072},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.4606921672821045},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.4327068328857422},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3661210536956787},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35124003887176514},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.09055840969085693}],"concepts":[{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.8904473781585693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7511414885520935},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5385374426841736},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.5062488913536072},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.4606921672821045},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.4327068328857422},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3661210536956787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35124003887176514},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.09055840969085693},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1137/s0097539705447281","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705447281","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"},{"id":"pmh:oai:dash.harvard.edu:1/41467485","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467485","pdf_url":null,"source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.121.9498","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.9498","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.columbia.edu/~viola/papers/STOC04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.125.837","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eecs.harvard.edu/~salil/papers/HardAmpNP-sicomp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.127.9819","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.9819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.columbia.edu/~viola/papers/NPJournal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.4242","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.4242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.columbia.edu/~viola/papers/STOC04.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.330.8559","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.8559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.alexhealy.net/papers/usingnondet.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.429.4092","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.4092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2004/087/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.3870","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.3870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eecs.harvard.edu/~salil/papers/HardAmpNP-oct04.pdf","raw_type":"text"},{"id":"mag:2407363631","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc11.html#TR04-087","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":{"id":"pmh:oai:dash.harvard.edu:1/41467485","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:41467485","pdf_url":null,"source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1548880861","https://openalex.org/W1569885018","https://openalex.org/W1901622511","https://openalex.org/W1974964982","https://openalex.org/W1998918799","https://openalex.org/W2023915883","https://openalex.org/W2058859323","https://openalex.org/W2062855793","https://openalex.org/W2062965695","https://openalex.org/W2079520411","https://openalex.org/W2100008268","https://openalex.org/W2130246629","https://openalex.org/W2135453633","https://openalex.org/W2611754984","https://openalex.org/W2998808137","https://openalex.org/W4212956348","https://openalex.org/W4213042755","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W2263327792","https://openalex.org/W2402942645","https://openalex.org/W2951642689","https://openalex.org/W3127093867","https://openalex.org/W2972131259","https://openalex.org/W2950519981","https://openalex.org/W3133665495","https://openalex.org/W2127319845","https://openalex.org/W2953060886","https://openalex.org/W3210909212","https://openalex.org/W2170001390","https://openalex.org/W1499430530","https://openalex.org/W2403485039","https://openalex.org/W2150806094","https://openalex.org/W2972401921","https://openalex.org/W2498049934","https://openalex.org/W2129522910","https://openalex.org/W2575353446","https://openalex.org/W267972510","https://openalex.org/W3197942683"],"abstract_inverted_index":{"We":[0,22,128,143],"revisit":[1],"the":[2,139,156],"problem":[3],"of":[4,36,47,59,72,106,107,119,141,153],"hardness":[5,83,91,99,166],"amplification":[6,167],"in":[7,138],"$\\mathcal{NP}$,":[8],"as":[9,170],"recently":[10],"studied":[11],"by":[12,132],"O'Donnell":[13,113],"[J.":[14],"Comput.":[15],"System":[16],"Sci.,":[17],"69":[18],"(2004),":[19],"pp.":[20],"68-94].":[21],"prove":[23,145],"that":[24,33,56,116,149,158],"if":[25,78,86,94],"$\\mathcal{NP}$":[26,50],"has":[27,51],"a":[28,44,52,67,120],"balanced":[29,161],"function":[30,53],"f":[31,42,159],"such":[32,55],"any":[34,57],"circuit":[35,58],"size":[37,60],"$s(n)$":[38],"fails":[39,62],"to":[40,63,82,90,98,111],"compute":[41,64],"on":[43,66],"$1/\\poly(n)$":[45],"fraction":[46,71],"inputs,":[48],"then":[49],"$f'$":[54,65],"$s'(n)=s(\\sqrt{n})^{\\Omega(1)}$":[61],"$1/2":[68],"-":[69],"1/s'(n)$":[70],"inputs.":[73],"In":[74],"particular,":[75],"\\begin{enumerate}":[76],"\\item":[77,85,93],"$s(n)=n^{\\omega(1)}$,":[79],"we":[80,88,96],"amplify":[81,89,97,110,125],"$1/2-1/n^{\\omega(1)}$;":[84],"$s(n)=2^{n^{\\Omega(1)}}$,":[87],"$1/2-1/2^{n^{\\Omega(1)}}$;":[92],"$s(n)=2^{\\Omega(n)}$,":[95],"$1/2-1/2^{\\Omega(\\sqrt{n})}$.":[100],"\\end{enumerate}":[101],"Our":[102],"results":[103,147],"improve":[104],"those":[105],"O'Donnell,":[108],"which":[109],"$1/2-1/\\sqrt{n}$.":[112],"also":[114,144],"proved":[115],"no":[117],"construction":[118,140],"certain":[121],"general":[122],"form":[123],"could":[124],"beyond":[126],"$1/2-1/n$.":[127],"bypass":[129],"this":[130],"barrier":[131],"using":[133],"both":[134,150],"derandomization":[135],"and":[136,155],"nondeterminism":[137,154],"$f'$.":[142],"impossibility":[146],"demonstrating":[148],"our":[151],"use":[152],"hypothesis":[157],"is":[160],"are":[162],"necessary":[163],"for":[164],"\"black-box\"":[165],"procedures":[168],"(such":[169],"ours).":[171]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}