Login / Signup
On Hardness of Approximating the Parameterized Clique Problem.
Subhash Khot
Igor Shinkar
Published in:
Electron. Colloquium Comput. Complex. (2015)
Keyphrases
</>
computational complexity
phase transition
learning theory
multiscale
databases
artificial intelligence
information theoretic
maximum weight
data sets
np complete
np hardness
maximum clique
independent set