简介:在这篇论文,我们学习有限复杂性的selfinjectiveKoszul代数学。当它是有限的时,我们证明复杂性是一个非否定的整数;并且范畴Jin郭云电子邮件:gjy@xtu.edu.cn全文预览(小,大)src=“http://ads.link.valueclick.net/jsmaster”type=text/javascript>type=text/javascript>如果(ValueLoaded)ValueShowAd();language=JavaScriptsrc=...http://ads.link.valueclick.net/cycle?host=hs0005647&b=pagebuster.183&v=1.2.20&c=00&hcat=M100&kissn=1439-7617&kkeyword=selfinjectiveKoszul代数学,复杂性,斜组代数学,平淡的对称的代数学,16G60,16G20,有限complexity&aid=1439-7617&pid=10.1007/s10114-009-6703-0&bso=listed&msizes=468x60&t=js的16D50&kdoi=10.1007/s10114-009-6703-0&ktitle=SelfinjectiveKoszul代数学...>...>var闪光名字...“...”;varaltImgName=“http://cdn.valueclick.net/hg/0120/a0120602/Springer_TOC_Alerts.gif”;varxmlfile=“http://cdn.valueclick.net/hg/0120/a0120602/sgwIssnJournalMapping.xml”;varminFlashVer=5;var宽度=468;var高度=60;var按标签=“http://ads.link.valueclick.net/redirect?host=h0005647;size=468x60;t=js;c=00;target_id=0;hcat=M100;aid=1439-7617;pid=10.1007/s10114-009-6703-0;banner=a0120602;vcurlpreserve=”;vargifclickTAG=“http://ads.link.valueclick.net/redirect?host=h0005647;size=468x60;t=js;c=00;target_id=0;hcat=M100;aid=1439-7617;pid=10.1007/s10114-009-6703-0;banner=a0120602;vcurlpreserve=”;var插件=0;vard=文件;如果(navigator.mimeTypes&&navigator.mimeTypes[“application/x-shockwave-flash”]&&navigator.mimeTypes[“application/x-shockwave-flash”].enabledPlugin){如果(navigator.plugins&&navigator.plugins[“冲击波闪光”])varswver=(navigator.plugins[“冲击波闪光”].description.split(''))[2];如果(swver>=minFlashVer)插件=1;}另外如果(navigator.userAgent&&navigator.userAgent.indexOf(“MSIE”)>=0&&(navigator.u
简介:Weobtaintheoptimalorderofhigh-dimensionalintegrationcomplexityinthequantumcomputationmodelinanisotropicSobolevclassesW∞^r([0,1]^d)andHǒlderNikolskiiclassesH∞^r([0,1]^d).Itisprovedthatfortheseclassesoffunctionsthereisaspeed-upofquantumalgorithmsoverdeterministicclassicalalgorithmsduetofactorn^-1andoverrandomizedclassicalmethodsduetofactorn^-1/2.Moreover,wegiveanestimationforoptimalquerycomplexityintheclassH∞^∧(D)whosesmoothnessindexistheboundaryofsomecompletesetinZ+^d.
简介:自从以前的世纪的中间,原子原子核的壳模型在集中的使用。很复杂的原子核的这个简单模型,提供对它的许多特征的量的描述。另外的特征从极端图画从小偏差列在后面。我们的朋友和使贡献精液到这的同事AkitoArima回答在原子核的磁性的时刻与Horie以他的著名论文开始[学监。Theor。Phys。11,509(1954)]。在下列,对一个简单例子的详细描述被考虑。它是在在407/2壳>Ca和48Ca并且在在48Ca和56Ni。结果表明壳模型的力量和优雅。他们显示出简洁怎么从复杂性产生。从简单的壳模型的小偏差怎么导致效果,在原子价,中子行动,也被显示出好像他们带电的充电。
简介:在这份报纸,我们证明在范畴之间有一个自然等价?与给定的周期的模块的过滤的复杂性1的Koszul模块的1(x)作为一个m鈥揹imensional向量空格的外面的代数学螞=鈭的因素模块,并且有限鈥揹imensional的范畴局部地m鈥?的多项式代数学的nilpotent模块1个变量。关键词外面的代数学-Koszul模块-复杂性先生(2000)题目分类16G70-在他们的第60生日奉献给教授Roberto市场铆nez鈥揤illa和RaymondoBautista的16D90这研究被NSFC#10371036并且由湖南的省的教育部的关键工程#2A024部分地支持
简介:Thepresentpaperdealswiththeaveragecase,complexityoftheshift-invariantproblem.Themainaimistogiveanewproofoftheupperboundofaverageerroroffiniteelementmethod.OurmethodisbasedonthetechniquesproposedbyHeinrich(1990).WealsopointoutanessentialerrorregardingtheproofoftheupperboundinA.G.Werschulz(1991).
简介:Aroutingtreeforasetoftasksisadecisiontreewhichassignsthetaskstotheirdestinationsaccordingtothefeaturesofthetasks.Aweightedroutingtreeisonewithcostsattachedtoeachlinkofthetree.Linksofthesamefeaturehavethesamecost.Itisprovedthattheproblemoffinding?routingtreeoftheminimumcostforagivensetoftasksoftwofeaturesisNP-complete.
简介:ThispaperdealswiththeapproximatesolutionoftheFredholmequationLu=fofthesecondkindwithf∈H’(Γ).First,wegivetheorderofthen-theoptimalradiusintheworstcasesetting.Then,weshowthattheGalerkinmethodusing2n+1innerproductsoffhasminimalerror.Finally,wegivetheestimateoftheε-complexityoftheFredholmproblemofthesecondkindandGalerkinmethodintheworstcasesetting.
简介:这篇论文建议通过为N车辆探索问题分析它的输入条件估计问题的计算复杂性的一个方法。N车辆问题第一被提出在1的排列的集合决定最佳的代替到N。这个问题的复杂性N(问题的输入规模)是因素的。到平衡精确性和一般算法的效率,这篇论文提及一个新系统的算法图案并且讨论在问题和它的输入条件的复杂性之间的通讯,除就象往常一样提出一个一致近似算法以外。这是为分析NP问题的计算的一种新技术。方法相应然后被介绍。我们最后执行模拟验证方法的优点:1)到在枚举的减少计算;2)高效地为任何N车辆盒子获得计算复杂性;3)由方法估计了根据它的复杂性为任何N车辆盒子指导一个算法图案。
简介:Inthispaper,athreedimensionalratio-dependentchemostatmodelwithperiod-icallypulsedinputisconsidered.ByusingthediscretedynamicalsystemdeterminedbythestroboscopicmapandFloquettheorem,anexactperiodicsolutionwithpositiveconcentrationsofsubstrateandpredatorintheabsenceofpreyisobtained.Whenβislessthansomecriti-calvaluetheboundaryperiodicsolution(x_s(t),0,z_s(t))islocallystable,andwhenβislargerthanthecriticalvaluethereareperiodicoscillationsinsubstrate,preyandpredator.IncreasingtheimpulsiveperiodT,thesystemundergoesaseriesofperiod-doublingbifurcationleadingtochaos,whichimpliesthatthedynamicalbehaviorsoftheperiodicallypulsedratio-dependentpredator-preyecosystemareverycomplex.
简介:Klapper(1994)showedthatthereexistsaclassofgeometricsequenceswiththemaximalpossiblelinearcomplexitywhenconsideredassequencesoverGF(2),butthesesequenceshaveverylowlinearcomplexitieswhenconsideredassequencesoverGF(p)(pisanoddprime).ThislinearcomplexityofabinarysequencewhenconsideredasasequenceoverGF(p)iscalledGF(p)complexity.ThisindicatesthatthebinarysequenceswithhighGF(2)linearcomplexitiesareinadequateforsecurityinthepracticalapplication,while,theirGF(p)linearcomplexitiesarealsoequallyimportant,evenwhentheonlyconcerniswithattacksusingtheBerlekamp-Masseyalgorithm[Massey,J.L.,Shift-registersynthesisandbchdecoding,IEEETransactionsonInformationTheory,15(1),1969,122–127].Fromthisperspective,inthispapertheauthorsstudytheGF(p)linearcomplexityofHall’ssexticresiduesequencesandsomeknowncyclotomic-set-basedsequences.