{"id":"https://openalex.org/W7164046237","doi":"https://doi.org/10.1145/3798129.3800879","title":"SVP&lt;i&gt;&lt;sub&gt;p&lt;/sub&gt;&lt;/i&gt; Is Deterministically NP-Hard for All p &gt; 2, Even to Approximate within a Factor of &lt;i&gt;2&lt;sup&gt;log&lt;sup&gt;1-\u03b5&lt;/sup&gt;n&lt;/sup&gt;&lt;/i&gt;","display_name":"SVP&lt;i&gt;&lt;sub&gt;p&lt;/sub&gt;&lt;/i&gt; Is Deterministically NP-Hard for All p &gt; 2, Even to Approximate within a Factor of &lt;i&gt;2&lt;sup&gt;log&lt;sup&gt;1-\u03b5&lt;/sup&gt;n&lt;/sup&gt;&lt;/i&gt;","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164046237","doi":"https://doi.org/10.1145/3798129.3800879"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800879","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800879","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800879","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118263102","display_name":"Isaac M. Hair","orcid":"https://orcid.org/0000-0001-6992-4488"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]},{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Isaac M. Hair","raw_affiliation_strings":["University of California at Los Angeles, Los Angeles, USA","University of California at Santa Barbara, Santa Barbara, USA"],"raw_orcid":"https://orcid.org/0000-0001-6992-4488","affiliations":[{"raw_affiliation_string":"University of California at Los Angeles, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California at Santa Barbara, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103835895","display_name":"Amit Sahai","orcid":"https://orcid.org/0000-0003-2216-9600"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amit Sahai","raw_affiliation_strings":["University of California at Los Angeles, Los Angeles, USA"],"raw_orcid":"https://orcid.org/0000-0003-2216-9600","affiliations":[{"raw_affiliation_string":"University of California at Los Angeles, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5118263102"],"corresponding_institution_ids":["https://openalex.org/I154570441","https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.96231156,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1716","last_page":"1727"},"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.46630001068115234,"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.46630001068115234,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.06199999898672104,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.04410000145435333,"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/set","display_name":"Set (abstract data type)","score":0.29679998755455017},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.28859999775886536},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.2815999984741211},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.27140000462532043},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.25679999589920044}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.486299991607666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3294000029563904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2969000041484833},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.29679998755455017},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28040000796318054},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2533000111579895},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800879","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800879","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800879","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800879","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1488435683","https://openalex.org/W1966034053","https://openalex.org/W1977134468","https://openalex.org/W2007466965","https://openalex.org/W2012589104","https://openalex.org/W2040579873","https://openalex.org/W2044471216","https://openalex.org/W2056492141","https://openalex.org/W2070971235","https://openalex.org/W2078090052","https://openalex.org/W2090960684","https://openalex.org/W2096221836","https://openalex.org/W2144593761","https://openalex.org/W2151241472","https://openalex.org/W2152221184","https://openalex.org/W2153413398","https://openalex.org/W2156360762","https://openalex.org/W2165406488","https://openalex.org/W2293438091","https://openalex.org/W2517177595","https://openalex.org/W2774310513","https://openalex.org/W2886103250","https://openalex.org/W2957320394","https://openalex.org/W3144422206","https://openalex.org/W3154203804","https://openalex.org/W3202483697","https://openalex.org/W4205550388","https://openalex.org/W4205765479","https://openalex.org/W4237963784","https://openalex.org/W4322723250","https://openalex.org/W7128646609"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-10T14:10:52.464848","created_date":"2026-06-10T00:00:00"}