{"id":"https://openalex.org/W1968556476","doi":"https://doi.org/10.1145/2422436.2422458","title":"Towards an optimal query efficient PCP?","display_name":"Towards an optimal query efficient PCP?","publication_year":2013,"publication_date":"2013-01-03","ids":{"openalex":"https://openalex.org/W1968556476","doi":"https://doi.org/10.1145/2422436.2422458","mag":"1968556476"},"language":"en","primary_location":{"id":"doi:10.1145/2422436.2422458","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2422436.2422458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science","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/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["NYU and U. Chicago, New York, USA","NYU and U. Chicago, New York, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"NYU and U. Chicago, New York, USA","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"NYU and U. Chicago, New York, USA#TAB#","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007318528","display_name":"Muli Safra","orcid":"https://orcid.org/0000-0002-5022-7727"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Muli Safra","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057481716","display_name":"Madhur Tulsiani","orcid":null},"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":"Madhur Tulsiani","raw_affiliation_strings":["TTI Chicago, Chicago, USA"],"affiliations":[{"raw_affiliation_string":"TTI Chicago, Chicago, USA","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067917669"],"corresponding_institution_ids":["https://openalex.org/I40347166"],"apc_list":null,"apc_paid":null,"fwci":1.0876,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77093108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"186"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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/soundness","display_name":"Soundness","score":0.9694108963012695},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7310422658920288},{"id":"https://openalex.org/keywords/linearity","display_name":"Linearity","score":0.6982677578926086},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6744036674499512},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6252778768539429},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.590828537940979},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5658789277076721},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.44526711106300354},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40654510259628296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33592116832733154},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2820891737937927},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16192370653152466}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.9694108963012695},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7310422658920288},{"id":"https://openalex.org/C77170095","wikidata":"https://www.wikidata.org/wiki/Q1753188","display_name":"Linearity","level":2,"score":0.6982677578926086},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6744036674499512},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6252778768539429},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.590828537940979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5658789277076721},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.44526711106300354},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40654510259628296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33592116832733154},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2820891737937927},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16192370653152466},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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":1,"locations":[{"id":"doi:10.1145/2422436.2422458","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2422436.2422458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th conference on Innovations in Theoretical Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1899212464","https://openalex.org/W1970259241","https://openalex.org/W1972934214","https://openalex.org/W1973433258","https://openalex.org/W1975810219","https://openalex.org/W1999032440","https://openalex.org/W2019578639","https://openalex.org/W2064334110","https://openalex.org/W2068871408","https://openalex.org/W2081254453","https://openalex.org/W2086653003","https://openalex.org/W2087038607","https://openalex.org/W2091921997","https://openalex.org/W2097823813","https://openalex.org/W2098363469","https://openalex.org/W2102373437","https://openalex.org/W2108684595","https://openalex.org/W2120358419","https://openalex.org/W2133263321","https://openalex.org/W2146453677","https://openalex.org/W2148352980","https://openalex.org/W2165732281","https://openalex.org/W2977322974","https://openalex.org/W3004537778","https://openalex.org/W4239400817"],"related_works":["https://openalex.org/W13634261","https://openalex.org/W4250462479","https://openalex.org/W3163509751","https://openalex.org/W958050847","https://openalex.org/W2396405675","https://openalex.org/W175051304","https://openalex.org/W4402823833","https://openalex.org/W1549730417","https://openalex.org/W1548499332","https://openalex.org/W1994524667"],"abstract_inverted_index":{"We":[0,79],"construct":[1],"a":[2,25,44,52],"PCP":[3,26,55,83],"based":[4],"on":[5],"the":[6,32,71,89],"hyper-graph":[7,72],"linearity":[8,73],"test":[9,74],"with":[10,37,70,75],"3":[11,76],"free":[12,77],"queries.":[13,78],"It":[14],"has":[15],"near-perfect":[16],"completeness":[17],"and":[18,63],"soundness":[19,38,93],"strictly":[20],"less":[21],"than":[22],"1/8.":[23],"Such":[24],"was":[27],"known":[28],"before":[29],"only":[30],"assuming":[31],"Unique":[33],"Games":[34],"Conjecture,":[35],"albeit":[36],"arbitrarily":[39],"close":[40],"to":[41],"1/16.":[42],"At":[43],"technical":[45],"level,":[46],"our":[47],"main":[48],"contribution":[49],"is":[50,57],"constructing":[51],"new":[53],"outer":[54,82],"which":[56],"\"robust\"":[58],"against":[59],"bounded":[60],"degree":[61],"polynomials,":[62],"showing":[64],"that":[65],"it":[66],"can":[67],"be":[68,85],"composed":[69],"believe":[80],"this":[81],"may":[84],"useful":[86],"in":[87],"obtaining":[88],"optimal":[90],"query":[91],"vs.":[92],"tradeoff":[94],"for":[95],"PCPs.":[96]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}