Report - Fine-GrainedComplexityof k-OPTin Bounded ... · haveatmostn(2(d−2))k−1 sequentialk-moves(nchoicesforthestartingpoint,2choices for the next edge in E−, and at most d−2 choices

Select PornographicDefamatoryIllegal/UnlawfulSpamOther Terms Of Service ViolationFile a copyright complaint

Please pass captcha verification before submit form