Login / Signup
Almost Polynomial Factor Inapproximability for Parameterized k-Clique.
Karthik C. S.
Subhash Khot
Published in:
CoRR (2021)
Keyphrases
</>
approximation algorithms
knowledge base
database
data sets
artificial intelligence
multi agent
optimal solution
multi agent systems
expert systems
np hard
upper bound
factor analysis
independent set