{"id":"https://openalex.org/W2579583840","doi":"https://doi.org/10.1145/3055399.3055432","title":"On independent sets, 2-to-2 games, and Grassmann graphs","display_name":"On independent sets, 2-to-2 games, and Grassmann graphs","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2579583840","doi":"https://doi.org/10.1145/3055399.3055432","mag":"2579583840"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055432","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT 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/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["New York University, USA","New York University USA"],"affiliations":[{"raw_affiliation_string":"New York University, USA","institution_ids":["https://openalex.org/I57206974"]},{"raw_affiliation_string":"New York University USA","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063520549","display_name":"Dor Minzer","orcid":"https://orcid.org/0000-0002-8093-1328"},"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":"Dor Minzer","raw_affiliation_strings":["Tel Aviv University, Israel","Tel-Aviv Univ., Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel-Aviv Univ., Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","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, Israel","Tel-Aviv Univ., Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel-Aviv Univ., Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067917669"],"corresponding_institution_ids":["https://openalex.org/I57206974"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.02739726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":null,"first_page":"576","last_page":"589"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9225000143051147,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9225000143051147,"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/vertex-cover","display_name":"Vertex cover","score":0.7381112575531006},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6978486180305481},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6303192377090454},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6264810562133789},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5976466536521912},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.5533735156059265},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5302987098693848},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.47943705320358276},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4536953270435333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4522966146469116},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44692063331604004},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4126889407634735},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23592451214790344},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.19899484515190125},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.10934269428253174}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7381112575531006},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6978486180305481},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6303192377090454},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6264810562133789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5976466536521912},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.5533735156059265},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5302987098693848},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.47943705320358276},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4536953270435333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4522966146469116},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44692063331604004},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4126889407634735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23592451214790344},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.19899484515190125},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.10934269428253174},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3055399.3055432","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"mag:2579583840","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc23.html#Khot16","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1970259241","https://openalex.org/W1971749164","https://openalex.org/W1999032440","https://openalex.org/W2003159902","https://openalex.org/W2018925011","https://openalex.org/W2019578639","https://openalex.org/W2030970869","https://openalex.org/W2044471216","https://openalex.org/W2047861934","https://openalex.org/W2085573719","https://openalex.org/W2086423976","https://openalex.org/W2086653003","https://openalex.org/W2091602684","https://openalex.org/W2100780780","https://openalex.org/W2108684595","https://openalex.org/W2111385661","https://openalex.org/W2114448228","https://openalex.org/W2125534993","https://openalex.org/W2137118456","https://openalex.org/W2143112402","https://openalex.org/W2143698439","https://openalex.org/W2148352980","https://openalex.org/W2405388088","https://openalex.org/W3144422206","https://openalex.org/W6732672821"],"related_works":["https://openalex.org/W2625656873","https://openalex.org/W2922092846","https://openalex.org/W2058258808","https://openalex.org/W2624065397","https://openalex.org/W1967048340","https://openalex.org/W2577113188","https://openalex.org/W2142482847","https://openalex.org/W2950828137","https://openalex.org/W2405285952","https://openalex.org/W2164758402","https://openalex.org/W2090698092","https://openalex.org/W2254028205","https://openalex.org/W1584515386","https://openalex.org/W1885256053","https://openalex.org/W4514142","https://openalex.org/W2951295017","https://openalex.org/W2171379542","https://openalex.org/W3167416129","https://openalex.org/W2963460324","https://openalex.org/W1515723593"],"abstract_inverted_index":{"We":[0],"present":[1,15],"a":[2,16,35,93],"candidate":[3],"reduction":[4,33,40],"from":[5],"the":[6,10,29,32,88],"3-Lin":[7],"problem":[8,13,91],"to":[9,27,53,86],"2-to-2":[11],"Games":[12],"and":[14,80],"combinatorial":[17],"hypothesis":[18],"about":[19],"Grassmann":[20],"graphs":[21],"which,":[22],"if":[23],"correct,":[24],"is":[25,42,51,84],"sufficient":[26],"show":[28],"soundness":[30],"of":[31,63],"in":[34,44],"certain":[36],"non-standard":[37,46],"sense.":[38],"A":[39],"that":[41,49,82],"sound":[43],"this":[45],"sense":[47],"implies":[48],"it":[50,83],"NP-hard":[52,85],"distinguish":[54],"whether":[55,73],"an":[56,60],"n-vertex":[57],"graph":[58],"has":[59,77],"independent":[61,75],"set":[62,76],"size":[64,78],"(":[65],"1-":[66],"1/\u221a2":[67],")":[68],"n":[69],"-":[70],"o(n)":[71],"or":[72],"every":[74],"o(n),":[79],"consequently,":[81],"approximate":[87],"Vertex":[89],"Cover":[90],"within":[92],"factor":[94],"\u221a2-o(1).":[95]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-01-09T23:09:53.351390","created_date":"2025-10-10T00:00:00"}