{"id":"https://openalex.org/W2115404728","doi":"https://doi.org/10.1137/s0097539704443057","title":"A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover","display_name":"A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2115404728","doi":"https://doi.org/10.1137/s0097539704443057","mag":"2115404728"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539704443057","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704443057","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/A5029616850","display_name":"Irit Dinur","orcid":"https://orcid.org/0000-0002-4335-5237"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Irit Dinur","raw_affiliation_strings":["University of California at Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["University of Washington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","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/A5108189093","display_name":"Oded Regev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oded Regev","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.3142,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.98396323,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"34","issue":"5","first_page":"1129","last_page":"1146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/hypergraph","display_name":"Hypergraph","score":0.9453375935554504},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7856325507164001},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7660696506500244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7167519330978394},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7039572596549988},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6415605545043945},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.5308165550231934},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49970078468322754},{"id":"https://openalex.org/keywords/combinatorial-proof","display_name":"Combinatorial proof","score":0.4518886208534241},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43953168392181396},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4207741618156433},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.2809695899486542},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14835718274116516},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09336486458778381},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.0663263201713562}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9453375935554504},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7856325507164001},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7660696506500244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7167519330978394},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7039572596549988},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6415605545043945},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.5308165550231934},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49970078468322754},{"id":"https://openalex.org/C118539577","wikidata":"https://www.wikidata.org/wiki/Q3402784","display_name":"Combinatorial proof","level":2,"score":0.4518886208534241},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43953168392181396},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4207741618156433},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2809695899486542},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14835718274116516},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09336486458778381},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0663263201713562},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539704443057","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704443057","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320325263","display_name":"Environment and Climate Change Canada","ror":"https://ror.org/026ny0e17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1970259241","https://openalex.org/W1971749164","https://openalex.org/W1999032440","https://openalex.org/W2019578639","https://openalex.org/W2036930319","https://openalex.org/W2040924621","https://openalex.org/W2042587503","https://openalex.org/W2081254453","https://openalex.org/W2086653003","https://openalex.org/W2100780780","https://openalex.org/W2111385661","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2163322487","https://openalex.org/W2917103459"],"related_works":["https://openalex.org/W2100782222","https://openalex.org/W1956536100","https://openalex.org/W2963411648","https://openalex.org/W4297731553","https://openalex.org/W4298059473","https://openalex.org/W2951513093","https://openalex.org/W2950625434","https://openalex.org/W4300265938","https://openalex.org/W2131906507","https://openalex.org/W2115404728"],"abstract_inverted_index":{"Given":[0],"a":[1,21,46,95,131],"k-uniform":[2],"hypergraph,":[3],"the":[4,10,31,77,137],"Ek-Vertex-Cover":[5,40],"problem":[6,64],"is":[7,41,59,81,130,136],"to":[8,37,43,110,123],"find":[9],"smallest":[11],"subset":[12],"of":[13,48,76,86,90,103,120,139],"vertices":[14],"that":[15,29,39,98],"intersects":[16],"every":[17],"hyperedge.":[18],"We":[19,92],"present":[20],"new":[22],"multilayered":[23],"probabilistically":[24],"checkable":[25],"proof":[26,97,114],"(PCP)":[27],"construction":[28,73],"extends":[30],"Raz":[32],"verifier.":[33],"This":[34],"enables":[35],"us":[36],"prove":[38],"NP-hard":[42],"approximate":[44],"within":[45,69],"factor":[47,70,102],"$(k-1-\\epsilon)$":[49],"for":[50,117],"arbitrary":[51],"constants":[52],"$\\epsilon>0$":[53],"and":[54,80,134],"$k\\ge":[55],"3$.":[56],"The":[57],"result":[58],"nearly":[60],"tight":[61],"as":[62],"this":[63,113],"can":[65],"be":[66],"easily":[67],"approximated":[68],"k.":[71],"Our":[72],"makes":[74],"use":[75],"biased":[78],"long-code":[79],"analyzed":[82],"using":[83],"combinatorial":[84],"properties":[85],"s-wise":[87],"t-intersecting":[88],"families":[89],"subsets.":[91],"also":[93,115],"give":[94],"different":[96],"shows":[99],"an":[100],"inapproximability":[101],"$\\lfloor":[104],"\\frac{k}{2}":[105],"\\rfloor":[106],"-\\eps$.":[107],"In":[108],"addition":[109],"being":[111],"simpler,":[112],"works":[116],"superconstant":[118],"values":[119],"k":[121],"up":[122],"(log":[124],"N)1/c,":[125],"where":[126],"c":[127],">":[128],"1":[129],"fixed":[132],"constant":[133],"N":[135],"number":[138],"hyperedges.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}