Login / Signup
Almost Polynomial Factor Inapproximability for Parameterized k-Clique.
Karthik C. S.
Subhash Khot
Published in:
CCC (2022)
Keyphrases
</>
approximation algorithms
expert systems
database
neural network
real world
case study
three dimensional
higher order
factor analysis