The Average Time Complexity to Compute Prefix Functions

We analyze the average time complexity of evaluating all prefixes of an input vector over a given algebraic structure h\Sigma;. As a computational model networks of finite controls are used and a complexity measure for the average delay of such networks is

Th Aeevagre iTe Cmomlexpity to oCmpue trP e xuncFitno sni rPcoessro eNwortsMkdeziinsiceh Uinersvtat zu LubeciykAdrnaes akoJbyAstbrcat

We nalaze yth evaerae tgmie compelxit yo efavlauitgna l prel es xof aninput evtorco ve ar igvne lgaberaic srtutucr e ih. s aA ompcuattinal modolenet orwks f niote ocntrlos rea sed uad anc mopelity xmaesure frot eh varage edeayl ofs chu newotrs kisint oduredc Based .not ihs ntion,ow e teh de nen heta vragee caesc omlpexti yfo coamptatiunao plorlbemfo rrbiartay rtsircty lpostivei nput iditsriutbion.sWe gie av ocplete mcaractheirztaion fo teh veaagercompl xiey tof perx fucniont wsth iesprcteto th enudelryig nalebraig cstrcutuer i rhep.sth ec roerspondig noorM-meahcne .i Bycon sdireig a rnleate draehacbliiytpr oleb fomr inet utomataait is show thna thet omplecitxyon yl epdend sont wop orertipeso f, cllad ecnou nce anedd iunece We. prvoeop itmall wor ebunodsfo rthe av rage cesa eocmplexiyt Fu.rtehrome,ra networ kd segin isp rseetend thatac heievs ht eotimpl dalaye ofr al lrepx funtcion snadal lin ptsuo f gaive nlegtn hwhilekee ipngth entwoek rsze liienr.aIt i erd sussbattiallynfr m tohe knon wcnstourticon fos trh werost csae O.r unalyaiss yeidlst hato ly nhrteed erinte cses caa nrise afo rte herchabiaitl yqeusiton .W ehsowtha ta pe rx funcito can neb cmpuotde iteehr wit h canstanto vaeare dglae, oyr iwh tna averaeg dleayof roedrl o logg,orin caseof annoconu etn ufntcino hattn os eedpp usi posibles. Thi ismliespt htaa n xponeneial speedut comppardet o he towrs ctsa ies posisbe lfr oesvearl fuctions.nTh epr coesor setnworks iventsgiatd eo sfr aasi t i generasly thl percaitce,aer newtrksoo fbo nudd feann ani dfnaotu.We ex pan dor unalysisa ton tworeks f ounbouneddfano t anudo tbaina co rrespondnig hacrcaterzatiio.n;; MM n1 Itnrductionohe pTraalell pe r xproblem i a sundafemnat latsk wih t loat f oapplicaiton sucsh a addistin ofob iarynn mubers o rsolinvg linae rerucrenrces.To aec suchh ropleb ome anssciaotse a spcie cseimgourpt hta dsecibesrth e algbeaicr sructurte fo the porbem. Tlh cempleoixy tof th peaarlel lpr e proxblm eas hetenxsveli beyne nivetigstae id then iccuirtm doel Th.e naalsyis f ote hexepcetdt iem fo copmtiung het paallelrp re xfnutcoin oegsback t toeh nalayis osfB urk, Gosdstilen and,onvN ueannm19 6. I4nB uGN46]it i posntei odutth ta het spedeo thf arithmetec-loiig cniuto fa pr ocessr oamniy lepdnde onsth e seedpof t h aeddre used{ hicw hca sningi catnlyb eacceler tae dni he atvregae. heT authrs oahevex poledrthe xpeecet dlegnhto af crra cyhianan shdwo n logaraithicmup epran dlow e borud nfo rtehesc ahnsi T.e rehsltsuo Burfsket .a. hlve aeen improbedvby di ere n atuhtro s(see ofr eamxpelR iet60 Br,il3, 7RSW9J, B4LZ96G). B]aedson htseer suets selvral medeols of rcomuptni gte husmo ft o wn-b ti binay nrubmre s ceinely in tte hveraae gasc have beenea anyzeldin te lhteiaturr.eE xectep casdeu pep bround os ofrer O(dlo gol gn) ynIsittut urfT heroeitshceI fornmtaik W,lasltr ea4,0235 60 uLeckb,G emanyrsupported byDFG RseaecrhGr nat Re672 2 e-aml: ijakoyb@ifnrmotakim.-ulubeek.ced1

fo

We analyze the average time complexity of evaluating all prefixes of an input vector over a given algebraic structure h\Sigma;. As a computational model networks of finite controls are used and a complexity measure for the average delay of such networks is

trhea didtoi nnadoth r per xe porblms haevea sl boene obatneid i neRi9f] 3ndaJRSW94]. eRif hs aosbreev thad ticruictd eth pO(lg loog )n sis u cinte f ion allewsoa sm la lporitn oo finpt uevtcrsof rowhi h acwron gerslt mua bey btaoiedn .H hae slsao inrodutedc aircuci thatt userviseps htes eerror asd nocrretscthe m- butt hi rsquieersone ga te of nubuodndefan ni( se aelo Fagsi9,2 GHeo4])9. I contnastrto eRfis'c irciu ti JnRS94] weW aveh persnete d atsndaardcircu t ihattco rrectylc mputeo shet ddatioinwithin a n aysmpttio cminmim utiemfor a l lipntus. verEy pe xrf ucntino of wrhci hth endeurliyg nlgabearicstru cuteri sa seigmruop canob viusly oe cbopmuted i logarnthimcid pth.eLa dnreand Fscieh rhve ashwon ohwt ihs ac be done ni panrlall ueisg nolny lniae cricuitrsi z eLaFi80. Fu]rthe,rth e yave hshownthat ace fhnctuon ihatt acn e exbprssed beya M ooerachinemca nb etarnsforem indtoa semi grouph i;wh ee j jris ex onentpaili nthe izs efoth eM ooeracminhe.Sni r hs aotabien dxace btonds furot e trahde obetwee tnehdepth nda hte szi efop erx iccuirtsS ni86]r.Bilar d aid Prepanara htav studied teim-eize srtdea osfor hitsp roblme.Th ey hae gvienva c mopeltec haacterirztaon if toeh esimrgopus iwt hrspecte o thts iueqtisnoB irP8] by9p rvidoni tgihgtlowe anr uppdr beuodsn .Th cempoexltiyd eepns on dlaebgair cproeptierso f het smigeorpu I. is shotw tnat hnly two oacess ae rosspilb:ew tihnia wid era gneei hte rthe rpduotco f itm aed nsze irogsw nloylin erlayor as n og l .n I BnPir90]hetsa mea uthosrhave stuied doncstnt daepht nbuounde-fadninc icurtisan dlcasisfysemi gorpsuac cordngit ot h properety f hovaig linner aize pser x ircucis. tn JIaR9S] we4h av dee nd ae naeragv meaeure fso rhet edlayof Boo ean clircuitsc aleldt mie.The dieai st oatke dvantaaegof favoarbel csae is nwihh chte vlue aof a rp x cen baec omuptedf atse trha nwihtin he trtviial lweor obnduof lgariohtmci edpht.We ave showhnt aht fo srverael seimrgupo sike thle Boleon asmeigropu wiht ht OR oer th AeD-Noepraotr r foo trehsem giourp corrsepnoidn gotth ead itdoin o binfra ynumebsr on cen coaputme lalpr exsewi t an ahvearg deely oafo dre rogll go n aJS94, RJRW94S] Fu.rhetrmro, ethec icurti szi can ebe ept likear. Tnhat eamsnthere is a exnpoennital peesdupf om rteh orst wasc to eht aveearg ecsae On the .othr eahn, dor ffuntcinos ilk ePRIAT orY AMJORIYT onspeed pui sp sosilb.eIn J …… 此处隐藏：48949字，全部文档内容请下载后查看。喜欢就下载吧 ……