{"id":"https://openalex.org/W2405388088","doi":"https://doi.org/10.4086/toc.2013.v009a028","title":"","display_name":"","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2405388088","doi":"https://doi.org/10.4086/toc.2013.v009a028","mag":"2405388088"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2013.v009a028","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2013.v009a028","pdf_url":"https://theoryofcomputing.org/articles/v009a028/v009a028.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://theoryofcomputing.org/articles/v009a028/v009a028.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Subhash Khot","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007318528","display_name":"Muli Safra","orcid":"https://orcid.org/0000-0002-5022-7727"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Muli Safra","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.2055,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.66533937,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"9","issue":"1","first_page":"863","last_page":"887"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9926999807357788,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9926999807357788,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.954200029373169,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9261000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6529555320739746},{"id":"https://openalex.org/keywords/hadamard-transform","display_name":"Hadamard transform","score":0.6491836309432983},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6170388460159302},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5398826003074646},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.4667772352695465},{"id":"https://openalex.org/keywords/prime","display_name":"Prime (order theory)","score":0.42820748686790466},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41928428411483765},{"id":"https://openalex.org/keywords/hadamard-matrix","display_name":"Hadamard matrix","score":0.41665780544281006},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34136033058166504},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.11112067103385925}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6529555320739746},{"id":"https://openalex.org/C60292330","wikidata":"https://www.wikidata.org/wiki/Q1014065","display_name":"Hadamard transform","level":2,"score":0.6491836309432983},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6170388460159302},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5398826003074646},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.4667772352695465},{"id":"https://openalex.org/C184992742","wikidata":"https://www.wikidata.org/wiki/Q7243229","display_name":"Prime (order theory)","level":2,"score":0.42820748686790466},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41928428411483765},{"id":"https://openalex.org/C30463267","wikidata":"https://www.wikidata.org/wiki/Q1422682","display_name":"Hadamard matrix","level":3,"score":0.41665780544281006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34136033058166504},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.11112067103385925},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2013.v009a028","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2013.v009a028","pdf_url":"https://theoryofcomputing.org/articles/v009a028/v009a028.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2013.v009a028","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2013.v009a028","pdf_url":"https://theoryofcomputing.org/articles/v009a028/v009a028.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3212027502","display_name":"CAREER:  New Directions in Inapproximability and Probabilistically Checkable Proofs","funder_award_id":"0833228","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6752600216","display_name":"Collaborative Research: Understanding, Coping with, and Benefiting From, Intractability","funder_award_id":"0832795","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/W2405388088.pdf","grobid_xml":"https://content.openalex.org/works/W2405388088.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1483324665","https://openalex.org/W1868897294","https://openalex.org/W1970259241","https://openalex.org/W1970670479","https://openalex.org/W1972934214","https://openalex.org/W1999032440","https://openalex.org/W2003159902","https://openalex.org/W2019578639","https://openalex.org/W2055767422","https://openalex.org/W2081254453","https://openalex.org/W2086423976","https://openalex.org/W2086653003","https://openalex.org/W2087038607","https://openalex.org/W2091921997","https://openalex.org/W2111385661","https://openalex.org/W2122914790","https://openalex.org/W2125534993","https://openalex.org/W2132991500","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2152221184","https://openalex.org/W2153413398","https://openalex.org/W2167681887","https://openalex.org/W2218607027","https://openalex.org/W2342433841","https://openalex.org/W2610313478","https://openalex.org/W2886103250","https://openalex.org/W3004537778","https://openalex.org/W3102777411","https://openalex.org/W3144422206","https://openalex.org/W4226347946","https://openalex.org/W4244547255","https://openalex.org/W4300998111"],"related_works":["https://openalex.org/W2038981428","https://openalex.org/W3154819821","https://openalex.org/W1976224891","https://openalex.org/W2740724818","https://openalex.org/W2054788067","https://openalex.org/W1971692815","https://openalex.org/W2337094584","https://openalex.org/W2029809197","https://openalex.org/W2294836888","https://openalex.org/W1507795568"],"abstract_inverted_index":{"We":[0],"show":[1,112],"that":[2,71,113],"for":[3,57,79,95],"any":[4],"fixed":[5],"prime":[6],"$q":[7],"\\geq":[8],"5$":[9],"and":[10,86],"constant":[11],"$\\zeta":[12],">":[13],"0$,":[14],"it":[15],"is":[16,40,62,83,125],"NP-hard":[17],"to":[18,90,98,103],"distinguish":[19],"whether":[20],"a":[21,74,84,92,99,104],"two-prover":[22],"one-round":[23],"game":[24],"with":[25],"$q^6$":[26],"possible":[27],"answers":[28],"has":[29,116],"value":[30],"at":[31,35],"least":[32],"$1-\\zeta$":[33],"or":[34],"most":[36],"$\\frac{4}{q}$.":[37],"The":[38,60,67],"result":[39],"obtained":[41],"by":[42],"combining":[43],"two":[44],"techniques:":[45],"(i)":[46],"An":[47],"Inner":[48],"PCP":[49,69,106],"based":[50],"on":[51,73],"the":[52,121,141,144],"point":[53],"versus":[54],"subspace":[55],"test":[56,61,94],"linear":[58],"functions.":[59],"analyzed":[63],"Fourier":[64],"analytically.":[65],"(ii)":[66],"Outer/Inner":[68],"composition":[70],"relies":[72],"certain":[75],"sub-code":[76],"covering":[77],"property":[78],"Hadamard":[80,96],"codes.":[81],"This":[82],"new":[85],"essentially":[87],"black-box":[88],"method":[89],"translate":[91],"codeword":[93],"codes":[97],"consistency":[100],"test,":[101],"leading":[102],"full":[105],"construction.":[107],"As":[108],"an":[109],"application,":[110],"we":[111],"unless":[114],"NP":[115],"quasi-polynomial":[117],"time":[118],"deterministic":[119],"algorithms,":[120],"Quadratic":[122],"Programming":[123],"Problem":[124],"inapproximable":[126],"within":[127],"factor":[128],"$(\\log":[129],"n)^{1/6":[130],"-":[131],"o(1)}$.":[132],"A":[133],"preliminary":[134],"version":[135],"of":[136,143],"this":[137],"paper":[138],"appeared":[139],"in":[140],"Proceedings":[142],"52nd":[145],"IEEE":[146],"FOCS,":[147],"2011.":[148]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":10},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2016-06-24T00:00:00"}