简介:“温都姑娘关于爱情的意见”等“NP1+[P+NP2]+的+XP”词语串的结构层次为“[温都姑娘][关于爱情的意见]”,因此它可以构成一个语法形式,也可以不是一个语法形式。这种词语串与“NP1+的+P+NP2+的+XP”结构至少有三个方面的不同:层次切分不同,结构来源不同和句法性质不同。
简介:Thetheoryofparameterizedcomputationandcomplexityisarecentlydevelopedsubareaintheoreticalcomputerscience.Thetheoryisaimedatpracticallysolvingalargenumberofcomputationalproblemsthataretheoreticallyintractable.Thetheoryisbasedontheobservationthatmanyintractablecomputationalproblemsinpracticeareassociatedwithaparameterthatvarieswithinasmallormoderaterange:Therefore,bytakingtheadvantagesofthesmallparameters,manytheoreticallyintractableproblemscanbesolvedeffectivelyandpractically.Ontheotherhand,thetheoryofparameterizedcomputationandcomplexityhasalsoofferedpowerfultechniquesthatenableustoderivestrongcomputationallowerboundsformanycomputationalproblems,thusexplainingwhycertaintheoreticallytractableproblemscannotbesolvedeffectivelyandpractically.Thetheoryofparameterizedcomputationandcomplexityhasfoundwideapplicationsinareassuchasdatabasesystems,programminglanguages,networks,VLSIdesign,parallelanddistributedcomputing,computationalbiology,androbotics.Thissurveygivesanoverviewonthefundamentals,algorithms,techniques,andapplicationsdevelopedintheresearchofparameterizedcomputationandcomplexity.Wewillalsoreportthemostrecentadvancesandexcitements,anddiscussfurtherresearchdirectionsinthearea.
简介:InthispaperweprovethatthesinglemachinecommonduedateweightedtardinessproblemisNP-hard.