5Some basic complexity results.pdf

5Some basic complexity results.pdf

ID:33937859

大小:73.97 KB

页数:5页

时间:2019-02-28

5Some basic complexity results.pdf_第1页
5Some basic complexity results.pdf_第2页
5Some basic complexity results.pdf_第3页
5Some basic complexity results.pdf_第4页
5Some basic complexity results.pdf_第5页
资源描述:

《5Some basic complexity results.pdf》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、TelAvivUniversity,Fall2004Lecture5Lecturer:OdedRegevLatticesinComputerScienceSomebasiccomplexityresultsScribe:IshayHavivInthislecturewepresentsomebasiccomputationalcomplexityresultsrelatedtolatticeproblems.Wefocusmainlyontheclosestlatticevectorproblem(CVP)anditsvariants.1DecisionversusS

2、earchRecallthatintheclosestvectorproblemwearegivenalatticeandatargetvector(whichisusuallynotinthelattice)andwearesupposedtofindthelatticepointthatisclosesttothetargetpoint.Moreprecisely,onecanconsiderthreevariantsoftheCVP,dependingonwhetherwehavetoactuallyfindtheclosestvector,finditsdistan

3、ce,oronlydecideifitiscloserthansomegivennumber:²DecisionalCVP:GivenalatticebasisB2Zm£n,atargetvectort2Zm,andarationalr2Q,determinewhetherdist(t;L(B))·rornot.²OptimizationCVP:GivenalatticebasisB2Zm£nandatargetvectort2Zm,finddist(t;L(B)).²SearchCVP:GivenalatticebasisB2Zm£nandatargetvectort

4、2Zm,findx2ZnthatminimizeskBx¡tk.Itisnotdifficulttoseethatasolutiontothesearchvariantimmediatelyimpliesasolutiontotheop-timizationvariant;furthermore,asolutiontotheoptimizationvariantimpliesasolutiontothedecisionalvariant.Thenextlemmashowsthattheconversealsoholds,andhenceallthreevariantsar

5、einfactpolyno-miallyequivalent.LEMMA1SearchCVPcanbesolvedinpolynomialtimegivenanoraclethatsolvesdecisionalCVP.PROOF:GivenabasisB=(b1;:::;bn)andatargett,ourfirstgoalistodeterminer=dist(t;L(B))(inotherwords,wefirstsolvetheoptimizationvariantofCVP).Theideaistousebinarysearch.MorePnprecisely,

6、defineR=i=1kbikandnoticethat0·r·R,soRisa(rough)upperboundonthedistance.Moreover,noticethatr,asthel2distancebetweentwointegerpoints,mustbethesquarerootofaninteger.Hence,thereareonlyR2possiblevaluesforr.Therefore,abinarysearchfordist(t;L(B))usingthedecisionalCVPoracleneedsatmost2logRsteps,

7、whichispolynomialintheinputsize.Nowthatwefoundr=dist(t;L(B)),ourgoalistofindtheclosestvectortot.Ourfirstobservationisthatitisenoughtofindtheclosestlatticevectortoanypointoftheformt+vwherev2L(B)(sincewecantheneasilysubtractvfromtheanswertoobtaintheclosestvectortot).Inordertodothis,

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。