{"id":"https://openalex.org/W72831347","doi":"https://doi.org/10.1145/1060590.1060631","title":"Simple PCPs with poly-log rate and query complexity","display_name":"Simple PCPs with poly-log rate and query complexity","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W72831347","doi":"https://doi.org/10.1145/1060590.1060631","mag":"72831347"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060631","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060631","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5058111762","display_name":"Eli Ben\u2010Sasson","orcid":"https://orcid.org/0000-0002-0708-0483"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eli Ben-Sasson","raw_affiliation_strings":["Israel Institute of Technology, Haifa, Israel and Toyota Technological Institute, Chicago, IL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Israel Institute of Technology, Haifa, Israel and Toyota Technological Institute, Chicago, IL","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Madhu Sudan","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA","Massachusetts Institute of Technology, Cambridge, MA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA,","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00730488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"266","last_page":"275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9958000183105469,"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.9958000183105469,"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.9886000156402588,"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/T11567","display_name":"semigroups and automata theory","score":0.9819999933242798,"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/degree","display_name":"Degree (music)","score":0.6538339257240295},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6383422613143921},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6107820272445679},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5847934484481812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5582804083824158},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5427129864692688},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5410280823707581},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5218628644943237},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.503154456615448},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4904477298259735},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.470688134431839},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.44545698165893555},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.41186168789863586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3281981945037842},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2468966841697693},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.09658753871917725}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6538339257240295},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6383422613143921},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6107820272445679},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5847934484481812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5582804083824158},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5427129864692688},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5410280823707581},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5218628644943237},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.503154456615448},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4904477298259735},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.470688134431839},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.44545698165893555},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.41186168789863586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3281981945037842},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2468966841697693},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.09658753871917725},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1060590.1060631","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060631","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.174.8264","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.8264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.csail.mit.edu/madhu/papers/2005/rspcpp-conf.pdf","raw_type":"text"},{"id":"mag:72831347","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc11.html#ECCC-TR04-060","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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1569612250","https://openalex.org/W1591344124","https://openalex.org/W1970808997","https://openalex.org/W1978478346","https://openalex.org/W1999032440","https://openalex.org/W2002930326","https://openalex.org/W2018925011","https://openalex.org/W2019578639","https://openalex.org/W2022381972","https://openalex.org/W2029859729","https://openalex.org/W2034154168","https://openalex.org/W2053086236","https://openalex.org/W2067596507","https://openalex.org/W2078090052","https://openalex.org/W2086653003","https://openalex.org/W2091921997","https://openalex.org/W2111385661","https://openalex.org/W2113244484","https://openalex.org/W2146261818","https://openalex.org/W2148352980","https://openalex.org/W2152221184","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W2034154168","https://openalex.org/W2087900794","https://openalex.org/W1978478346","https://openalex.org/W1605144615","https://openalex.org/W2556940513","https://openalex.org/W2403422998","https://openalex.org/W2130703751","https://openalex.org/W2303247699","https://openalex.org/W3029599702","https://openalex.org/W2742040237","https://openalex.org/W3031715001","https://openalex.org/W3105296533","https://openalex.org/W3129128072","https://openalex.org/W935592923","https://openalex.org/W2914525031","https://openalex.org/W1966671033","https://openalex.org/W3119413233","https://openalex.org/W2889356414","https://openalex.org/W3082356466","https://openalex.org/W2885314357"],"abstract_inverted_index":{"We":[0,33,90,153],"give":[1,35,155],"constructions":[2,36,45,64,204,218],"of":[3,8,17,19,30,37,46,56,75,97,101,111,128,163,177,198,227],"probabilistically":[4],"checkable":[5],"proofs":[6],"(PCPs)":[7],"length":[9],"n":[10],".":[11],"poly(log":[12,27],"n)":[13,21,28],"(to":[14],"prove":[15],"satisfiability":[16],"circuits":[18],"size":[20],"that":[22,113,165,202],"can":[23],"verified":[24],"by":[25,104,181],"querying":[26],"bits":[29],"the":[31,73,95,99,109,136,149,160,178,186,191,194,221],"proof.":[32],"also":[34],"locally":[38],"testable":[39],"codes":[40,76],"(LTCs)":[41],"with":[42],"similar":[43],"parameters.Previous":[44],"short":[47],"PCPs":[48],"(from":[49],"[5]to":[50],"[9])":[51],"relied":[52],"extensively":[53],"on":[54,66,78],"properties":[55,74],"low":[57],"degree":[58,80],"multi-variate":[59],"polynomials.":[60],"In":[61,214],"contrast,":[62,215],"our":[63,203],"rely":[65],"new":[67,145,157],"problems":[68],"and":[69,142,185,200],"techniques":[70],"revolving":[71],"around":[72],"based":[77],"high":[79],"polynomials":[81],"in":[82,139,190,220],"one":[83],"variable":[84],"(also":[85],"known":[86],"as":[87],"Reed-Solomon":[88,122,173],"codes).":[89],"show":[91],"how":[92],"to":[93,108,119,147,170,212],"convert":[94],"problem":[96],"verifying":[98,112],"satisfaction":[100],"a":[102,105,114,121,125,144,156,166,172,182],"circuit":[103],"given":[106,115],"assignment":[107],"task":[110,162],"function":[116,167],"is":[117,133,168,180,193],"close":[118,169],"being":[120,171],"codeword,":[123],"i.e.,":[124],"univariate":[126],"polynomial":[127],"specified":[129],"degree.":[130],"This":[131,175],"reduction":[132],"simpler":[134],"than":[135],"corresponding":[137],"steps":[138],"previous":[140],"reductions,":[141],"gives":[143],"alternative":[146],"using":[148],"popular":[150],"\"sum-check":[151],"protocol\".":[152],"then":[154,210],"PCP":[158],"for":[159],"special":[161],"proving":[164],"codeword.":[174],"step":[176],"construction":[179],"self-contained":[183],"recursion,":[184],"only":[187],"ingredient":[188],"needed":[189],"analysis":[192],"bi-variate":[195],"low-degree":[196],"test":[197],"Polischuk":[199],"Spielman[27].Note":[201],"yield":[205],"LTCs":[206,229],"first,":[207],"which":[208],"are":[209],"converted":[211],"PCPs.":[213,231],"most":[216],"recent":[217],"go":[219],"opposite":[222],"(and":[223],"less":[224],"natural)":[225],"direction":[226],"getting":[228],"from":[230]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}