{"id":"https://openalex.org/W2029767661","doi":"https://doi.org/10.1137/070698348","title":"Low-End Uniform Hardness versus Randomness Tradeoffs for AM","display_name":"Low-End Uniform Hardness versus Randomness Tradeoffs for AM","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2029767661","doi":"https://doi.org/10.1137/070698348","mag":"2029767661"},"language":"en","primary_location":{"id":"doi:10.1137/070698348","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070698348","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/A5062263696","display_name":"Ronen Shaltiel","orcid":"https://orcid.org/0000-0002-5182-593X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ronen Shaltiel","raw_affiliation_strings":["ronen@haifa.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"ronen@haifa.ac.il#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108503268","display_name":"Christopher Umans","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christopher Umans","raw_affiliation_strings":["umans@cs.caltech.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"umans@cs.caltech.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062263696"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1142,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.86555654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"39","issue":"3","first_page":"1006","last_page":"1037"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9995999932289124,"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.9979000091552734,"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/randomness","display_name":"Randomness","score":0.8608862161636353},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.6062553524971008},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5228857398033142},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5049546360969543},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.48498058319091797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4626399576663971},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4460573196411133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4060254693031311},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3931208550930023},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1856595277786255},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1286959946155548},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08017751574516296},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07742723822593689}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.8608862161636353},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.6062553524971008},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5228857398033142},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5049546360969543},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.48498058319091797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4626399576663971},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4460573196411133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4060254693031311},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3931208550930023},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1856595277786255},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1286959946155548},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08017751574516296},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07742723822593689},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/070698348","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070698348","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:authors.library.caltech.edu:16468","is_oa":false,"landing_page_url":"https://resolver.caltech.edu/CaltechAUTHORS:20091023-111539349","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.154.9832","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.9832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://authors.library.caltech.edu/16468/1/Shaltiel2009p6016Siam_J_Comput.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W25285532","https://openalex.org/W1481582196","https://openalex.org/W1572772224","https://openalex.org/W1594962164","https://openalex.org/W1901622511","https://openalex.org/W1984976620","https://openalex.org/W1996839061","https://openalex.org/W1998918799","https://openalex.org/W2021652795","https://openalex.org/W2021736779","https://openalex.org/W2022068408","https://openalex.org/W2024411274","https://openalex.org/W2026036943","https://openalex.org/W2033385084","https://openalex.org/W2053086236","https://openalex.org/W2061106457","https://openalex.org/W2082647621","https://openalex.org/W2083237534","https://openalex.org/W2097206148","https://openalex.org/W2098324348","https://openalex.org/W2104536936","https://openalex.org/W2104965768","https://openalex.org/W2111978056","https://openalex.org/W2132833941","https://openalex.org/W2135453633","https://openalex.org/W2148368275","https://openalex.org/W2148957455","https://openalex.org/W2154831814","https://openalex.org/W2158747250","https://openalex.org/W2160403361","https://openalex.org/W2164284862","https://openalex.org/W2169453948","https://openalex.org/W2293988196","https://openalex.org/W2998808137","https://openalex.org/W3165549676","https://openalex.org/W4212956348","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W3034924094","https://openalex.org/W1488708774","https://openalex.org/W3094954546","https://openalex.org/W2981906196","https://openalex.org/W4391100477","https://openalex.org/W4327779705","https://openalex.org/W1513698804","https://openalex.org/W4310560702","https://openalex.org/W2029712093","https://openalex.org/W2990594069"],"abstract_inverted_index":{"Impagliazzo":[0],"and":[1,57,113,165,262,268,293],"Wigderson":[2],"[Proceedings":[3],"of":[4,12,47,83,106,134,183,194,229,238,272,283,291],"the":[5,32,44,80,103,135,144,160,270,288],"39th":[6],"Annual":[7],"IEEE":[8,15],"Symposium":[9],"on":[10,79,167],"Foundations":[11],"Computer":[13,16],"Science,":[14],"Society,":[17],"Washington,":[18],"DC,":[19],"1998,":[20],"pp.":[21,63,142],"734\u2013743]":[22],"proved":[23,65],"a":[24,66,120,131,180,192,199,257,277],"hardness":[25,49,68,85,93,108],"versus":[26,69,94],"randomness":[27,70,95],"tradeoff":[28,71],"for":[29,43,72,97,102,123,191,205,256],"BPP":[30],"in":[31,223,247,265,298],"uniform":[33,67,92],"setting,":[34],"which":[35],"was":[36],"subsequently":[37],"extended":[38],"to":[39,158,287],"give":[40,91],"optimal":[41],"tradeoffs":[42,96],"full":[45,104],"range":[46,105],"possible":[48,84,107],"assumptions":[50],"(in":[51],"slightly":[52],"weaker":[53],"settings).":[54],"Gutfreund,":[55,111,266],"Shaltiel,":[56,112],"Ta-Shma":[58],"[Comput.":[59,138],"Complexity,":[60,139],"12":[61],"(2003),":[62],"85\u2013130]":[64],"AM,":[73],"but":[74],"that":[75,99,185,211,214,281,296],"result":[76],"worked":[77],"only":[78,145],"\u201chigh":[81],"end\u201d":[82],"assumptions.":[86,109],"In":[87],"this":[88,117,150,299],"work,":[89],"we":[90,115,201],"AM":[98,124,206,208,216,218,239,241,273],"are":[100,186,233],"near-optimal":[101,258],"Following":[110],"Ta-Shma,":[114,269],"do":[116],"by":[118],"constructing":[119],"hitting-set-generator":[121],"(HSG)":[122],"with":[125,149,179],"\u201cresilient":[126],"reconstruction.\u201d":[127],"Our":[128],"construction":[129,148],"is":[130,157,282],"recursive":[132],"variant":[133],"Miltersen\u2013Vinodchandran":[136],"HSG":[137,147],"14":[140],"(2005),":[141],"256\u2013279],":[143],"known":[146],"required":[151],"property.":[152],"The":[153],"main":[154],"new":[155],"idea":[156],"have":[159],"reconstruction":[161],"procedure":[162],"operate":[163],"implicitly":[164],"locally":[166,195],"superpolynomially":[168],"large":[169],"objects,":[170],"using":[171],"tools":[172],"from":[173,188],"PCPs":[174],"(low-degree":[175],"testing,":[176],"self-correction)":[177],"together":[178],"novel":[181],"use":[182],"extractors":[184],"built":[187],"Reed\u2013Muller":[189],"codes":[190],"sort":[193],"computable":[196],"error-reduction.":[197],"As":[198,264],"consequence":[200],"obtain":[202],"gap":[203],"theorems":[204],"(and":[207],"$\\cap$":[209,219,242,274],"coAM)":[210,220,243],"state,":[212],"roughly,":[213],"either":[215],"(or":[217,240],"protocols":[221],"running":[222],"time":[224,249],"$t(n)$":[225,261],"can":[226,244,253],"simulate":[227],"all":[228,237],"EXP":[230],"(\u201cArthur\u2013Merlin":[231,251],"games":[232,252],"powerful\u201d)":[234],"or":[235],"else":[236],"be":[245,254],"simulated":[246],"nondeterministic":[248],"$s(n)$":[250],"derandomized\u201d)":[255],"relationship":[259],"between":[260],"$s(n)$.":[263],"Shatiel,":[267],"case":[271],"coAM":[275],"yields":[276],"particularly":[278],"clean":[279],"theorem":[280],"special":[284],"interest":[285],"due":[286],"wide":[289],"array":[290],"cryptographic":[292],"other":[294],"problems":[295],"lie":[297],"class.":[300]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}