OpenAlex
PricingAboutJobs
Log inGet started
Work

Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups

HTML

Year: 2026
Type: article
Source: Journal of the ACM
DOI: 10.1145/3862898
Authors: Amey Bhangale, Subhash Khot
Institutions: University of California, Riverside, Courant Institute School of Mathematics, Computing, and Data Science, New York University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: non-abelian groups, hardness of approximation, probabilistically checkable proofs, soundness, random assignment

Open Access status: closed
OpenAlex ID: W7234136541
FWCI:
Cites: 23
Cited by:
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security