Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT
classification
💻 cs.CC
cs.DS
keywords
inapproximabilityfixedparameterbasecliqueconsiderfoundationsproving
read the original abstract
In this paper, we consider proving inapproximability in terms of OPT and thus we base the foundations of fixed parameter inapproximability.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.