Fixed Parameter Inapproximability for Clique and SetCover in Time Super-exponential in OPT

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1310.2711 v2 pith:CX4SDXDD submitted 2013-10-10 cs.CC cs.DS

Mohammad T. Hajiaghayi , Rohit Khandekar , Guy Kortsarz This is my paper

classification cs.CC cs.DS

keywords inapproximabilityfixedparameterbasecliqueconsiderfoundationsproving

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

Share X Bluesky LinkedIn Reddit HN

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.