On Hardness of Approximating the Parameterized Clique Problem.

Subhash Khot Igor Shinkar

Published in: ITCS (2016)

Keyphrases

computational complexity
phase transition
information theoretic
databases
np hard
independent set
worst case
np complete
feature selection