{"id":"https://openalex.org/W1600412016","doi":"https://doi.org/10.1137/090747270","title":"A Counterexample to Strong Parallel Repetition","display_name":"A Counterexample to Strong Parallel Repetition","alternate_titles":[],"publication_year":2008,"publication_date":"2008-10-01","ids":{"openalex":"https://openalex.org/W1600412016","doi":"https://doi.org/10.1137/090747270","mag":"1600412016"},"language":"en","primary_location":{"id":"doi:10.1137/090747270","doi":"https://doi.org/10.1137/090747270","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090747270","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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"},"parent_works":[],"lineage":["https://openalex.org/W1600412016"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258","observed_orcids":["https://orcid.org/0009-0008-1656-2258"]},"institutions":[{"id":"https://openalex.org/I4210139428","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24","country_code":"IL","type":"nonprofit","lineage":["https://openalex.org/I4210139428"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Ran Raz","raw_affiliation_strings":["Weizmann Institute, Israel Science Foundation (ISF), the Binational Science Foundation (BSF) and the Minerva Foundation, Israel","ran.raz@weizmann.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute, Israel Science Foundation (ISF), the Binational Science Foundation (BSF) and the Minerva Foundation, Israel","institution_ids":["https://openalex.org/I4210139428"]},{"raw_affiliation_string":"ran.raz@weizmann.ac.il#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041545934"],"corresponding_institution_ids":["https://openalex.org/I4210139428"],"apc_list":null,"apc_paid":null,"fwci":10.4891,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.9889379,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"40","issue":"3","first_page":"369","last_page":"373"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.44679999351501465,"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.44679999351501465,"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/T11031","display_name":"Game Theory and Applications","score":0.241799995303154,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.07090000063180923,"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/xor-games","display_name":"XOR games","score":0.7919999957084656},{"id":"https://openalex.org/keywords/unique-games","display_name":"unique games","score":0.9779999852180481},{"id":"https://openalex.org/keywords/unique-games-conjecture","display_name":"Unique Games Conjecture","score":0.8169999718666077},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.9259999990463257},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.6079999804496765},{"id":"https://openalex.org/keywords/quantum-games","display_name":"quantum games","score":0.42500001192092896},{"id":"https://openalex.org/keywords/counterexample","display_name":"counterexample","score":0.3580000102519989}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.680158257484436},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6779655814170837},{"id":"https://openalex.org/C2776141515","wikidata":"https://www.wikidata.org/wiki/Q1274479","display_name":"Repetition (rhetorical device)","level":2,"score":0.6508609056472778},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6451406478881836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6361526846885681},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6194647550582886},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5549599528312683},{"id":"https://openalex.org/C53105687","wikidata":"https://www.wikidata.org/wiki/Q173227","display_name":"Physical constant","level":2,"score":0.5242864489555359},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4616239666938782},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42091476917266846},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.21682551503181458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14067497849464417},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.08405467867851257},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.06556499004364014},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05533170700073242},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/090747270","doi":"https://doi.org/10.1137/090747270","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090747270","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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":"doi:10.1109/focs.2008.49","doi":"https://doi.org/10.1109/focs.2008.49","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2008.49","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 49th Annual IEEE Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},{"id":"mag:1600412016","doi":null,"is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/eccc-reports/2008/TR08-018/index.html","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,"listed_in":["cwts-core"],"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":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.140.2294","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.2294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wisdom.weizmann.ac.il/~ranraz/publications/Pcounter.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.305.266","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.266","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wisdom.weizmann.ac.il/~ranraz/publications/Pcounter.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320878","display_name":"Minerva Foundation","ror":"https://ror.org/02rxjts25"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1507028355","https://openalex.org/W1543591046","https://openalex.org/W1937872493","https://openalex.org/W1970259241","https://openalex.org/W2007997869","https://openalex.org/W2019374631","https://openalex.org/W2061130579","https://openalex.org/W2087038607","https://openalex.org/W2099677042","https://openalex.org/W2108684595","https://openalex.org/W2116397277","https://openalex.org/W2117417786","https://openalex.org/W2120358419","https://openalex.org/W2132069633","https://openalex.org/W2137955570","https://openalex.org/W2154386769","https://openalex.org/W2951124766","https://openalex.org/W3179843568","https://openalex.org/W4242357733","https://openalex.org/W6679663036","https://openalex.org/W7096237928"],"related_works":["https://openalex.org/W7096201157","https://openalex.org/W6884761283","https://openalex.org/W2137955570","https://openalex.org/W1879643999","https://openalex.org/W7098674498","https://openalex.org/W7098523125","https://openalex.org/W2130318319","https://openalex.org/W7099958179","https://openalex.org/W3138766854","https://openalex.org/W7099492509"],"abstract_inverted_index":{"The":[0],"parallel":[1,23,75,117,143,156,206,269,315,322,374],"repetition":[2,76,157,207,270,316,323],"theorem":[3,324],"states":[4],"that,":[5,127],"for":[6,128,308],"any":[7],"two-prover":[8,100],"game":[9,20,95,101,114,140,331],"with":[10,102],"value":[11,17,103,109,135,199],"$1-\\epsilon$":[12],"(for,":[13],"say,":[14],"$\\epsilon\\leq1/2$),":[15],"the":[16,19,33,37,73,81,92,108,111,134,137,151,161,191,197,201,216,272,276,309,313,329,336,370],"of":[18,96,110,136,158,163,180,190,200,208,218,231,251,271,278,291,339,343],"repeated":[21,115,141],"in":[22,116,142,166,178,221,229,246,249,281,289,312],"n":[24,118,131,144],"times":[25,119,145],"is":[26,32,42,68,86,120,146,302,318,333],"at":[27,121,147,347,355],"most":[28,356],"$(1-\\epsilon^c)^{\\Omega(n/s)}$,":[29],"where":[30],"s":[31],"answer's":[34],"length":[35],"(of":[36],"original":[38],"game)":[39],"and":[40,213,226,245,262,286],"c":[41],"a":[43,99,320],"universal":[44],"constant":[45,202],"[R.":[46,167],"Raz,":[47,168],"SIAM":[48,169],"J.":[49,170],"Comput.,":[50,171],"27":[51,172],"(1998),":[52,173],"pp.":[53,174,187,240,258,300],"763\u2013803].":[54],"Several":[55],"researchers":[56],"asked":[57],"whether":[58],"this":[59,66,84,363],"bound":[60,277],"could":[61],"be":[62,365],"improved":[63],"to":[64,71,83,195,335],"$(1-\\epsilon)^{\\Omega(n/s)}$;":[65],"question":[67,85],"usually":[69],"referred":[70],"as":[72],"strong":[74,314,321],"problem.":[77],"We":[78,105],"show":[79,106],"that":[80,107,319,328,345,353,362],"answer":[82],"negative.":[87],"More":[88],"precisely,":[89],"we":[90],"consider":[91],"odd":[93,112,138,273],"cycle":[94,113,139,274],"size":[97],"m,":[98],"$1-1/2m$.":[104],"least":[122,148,348],"$1-(1/m)\\cdot":[123],"O(\\sqrt{n})$.":[124],"This":[125],"implies":[126],"large":[129],"enough":[130],"(say,":[132],"$n\\geq\\Omega(m^2)$),":[133],"$(1-1/4m^2)^{O(n)}$.":[149],"Thus":[150],"following":[152],"hold.":[153],"1.":[154],"For":[155,205,268],"general":[159],"games,":[160,210,212,215],"bounds":[162,217,372],"$(1-\\epsilon^c)^{\\Omega(n/s)}$":[164],"given":[165,220,280],"763\u2013803;":[175],"T.":[176],"Holenstein,":[177],"Proceedings":[179,230,250,290],"STOC":[181,252],"2002,":[182,186],"ACM,":[183,254],"New":[184,255],"York,":[185,256],"767\u2013775]":[188],"are":[189,265,346,354],"right":[192],"form,":[193],"up":[194],"determining":[196],"exact":[198],"$c\\geq2$.":[203],"2.":[204],"XOR":[209,243],"unique":[211,261,330],"projection":[214,263],"$(1-\\epsilon^2)^{\\Omega(n)}$":[219],"[U.":[222,282],"Feige,":[223,283],"G.":[224,284],"Kindler,":[225,285],"R.":[227,287],"O'Donnell,":[228,288],"CCC":[232,292],"2007,":[233,239,293,299],"IEEE":[234,294],"Computer":[235,295],"Society,":[236,296],"Washington,":[237,297],"DC,":[238,298],"179\u2013192]":[241,301],"(for":[242,260],"games)":[244,264],"[A.":[247],"Rao,":[248],"2008,":[253,257],"1\u201310]":[259],"tight.":[266,304],"3.":[267],"game,":[275],"$1-(1/m)\\cdot\\tilde{\\Omega}(\\sqrt{n})$":[279],"almost":[303],"A":[305],"major":[306],"motivation":[307],"recent":[310],"interest":[311],"problem":[317],"would":[325],"have":[326],"implied":[327],"conjecture":[332],"equivalent":[334],"NP":[337],"hardness":[338],"distinguishing":[340],"between":[341],"instances":[342,352],"Max-Cut":[344],"$1-\\epsilon^2$":[349],"satisfiable":[350],"from":[351],"$1-(2/\\pi)\\cdot\\epsilon$":[357],"satisfiable.":[358],"Our":[359],"results":[360],"suggest":[361],"cannot":[364],"proved":[366],"just":[367],"by":[368],"improving":[369],"known":[371],"on":[373],"repetition.":[375]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1600412016","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
