Computational Complexity(12)

发布时间:2021-06-10

In this work we study complexity classes in monotone computation. Our main contributions are the following: ffl A consistent framework for monotone computation, including monotone analogues of many standard computational models. We define monotone simulati

s oht eafmliia nroiotnsof modl iendpeenencedan d unviresa plrobemsl acrry trough. hO nhte ohert had thnre eermia snmoef unadmental d ereincse ebwteenmon tooenan d gneraelc molexitp,ya n padr to our goafl si tond nad xplein asuh ci erdecn

es. Erly raseercharesin thea reaof lowerbo udn fsrom notonoec icrits uewermot iatedv byth efo lowlign ohe:pperha pst he emhtdosd veleopd eo dtae wilth onmtoon coepumattionw uolde evtnalul by eaaptdbla teoh ande glenrae lomcupttaoi ans wlel La.te rerustl 3s2,4] h3vea shownt ishh pe to oe naibv.e We sek to cleraiyfw hat( ifan ) ryeevlacen mnoooten compleixy ths toa gnerae lcmpoleixyt .We rgaeutha tonmtono seperaatons aireint erstein whgen heyt eltlus s oetmhing idffreet nhatnwha t ew nkw oi nhet geenar mlodl.eIn tehse siutatonsi wen dtat there hsiso eminh erntlye onnmnotonoe isulatmon ioing gn ion th geneealrsett ing, an denhc ethis simlutaoin siin a|p rcies eessenstr|ongre hanttho s simelutions ahicwha re kownn to b moentone.oTh t ais,m ontono eseapartois mny aopit ontut h nenoboiovsu sretgthsn o fegneal comprtautoi.nFor xample,e hetfo llowngit ehcnquis eare niteestirng i that tnhye reaprovab yl nonmnotooen I:mermma nna Sdezepclsnyi's einducive tcuntingo ethnciqeu (haptecr3),uiversaln rtaversl saeuqecnes (chpter 3a,) Brrinagon'tsc ommtuaito tenhniqcue( haptcre )4. nI hist hacpetr e wgvei nainform alove rviwe nomo ntono coemlpeixt ynda mtovaie the pretset norkw I.n capthre2 we g ie a movr pereisc efamreowrkfor omnoton coemptautoi nand hsw othee qivuleaneco fv riaosum odesl .nI chatep 3 wer hsw otah ntonetedrminsitc iogsplcaei nots closed udner coplmemntateoini nt eh onotmoen rafmeorwk, ulnki Iemermanms s'iumatlin in oth easecof gneealr ocmptatiun. Inoc hapetr 4w preseen prteilmianryw or towardk asc onjetcre uotmiatevd y theb preiovsur sulte th;e cnoejcurt esi htt aaBrringtnos's imluaiotn alo hassn oonmtone anoaloueg .I ncapthre we 5hswo hat the mtootnoen analogeu o logfsace cpmoptautinoi sst rctlyimor eowerpfu lthan mnootoe nlo-geptdhc icrutsi Fi.nlal yi nhapter 6c wep reens tsveerla rmaeninigpr boemlss uggsetdeb y thi wosk.r

12

Computational Complexity(12).doc 将本文的Word文档下载到电脑

精彩图片

热门精选

大家正在看

× 游客快捷下载通道(下载后可以自由复制和排版)

限时特价:7 元/份 原价:20元

支付方式:

开通VIP包月会员 特价:29元/月

注:下载文档有可能“只有目录或者内容不全”等情况,请下载之前注意辨别,如果您已付费且无法下载或内容有问题,请联系我们协助你处理。
微信:fanwen365 QQ:370150219