Login / Signup
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups.
Amey Bhangale
Subhash Khot
Published in:
Electron. Colloquium Comput. Complex. (2020)
Keyphrases
</>
dynamic programming
multi agent
data sets
special case
constraint satisfaction
cluster analysis
approximation algorithms
phase transition
satisfiability problem
optimal control
real time
databases
upper bound
constraint satisfaction problems
optimal design