Design and Analysis of Algorithms算法设计与分析主讲人徐云Fall 2012, Fall 2012, USTCUSTC
Laboratoiredel’InformatiqueduParall´elisme´EcoleNormaleSup´erieuredeLyonUnit´eMixtedeRechercheCNRS-INRIA-ENSLYONno5668Ecole´46All´Normaleeed’Italie,69364Sup´Lyonerie...
Published in J. ALGORITHMS 3, 381-395 (1982)TheNP-CompletenessColumn:AnOngoingGuideDAVIDS.JOHNSONBellLaboratories,MurrayHill,NewJersey07974Thisisthefiftheditionofaquarterlycolumnthepurposeofwhichistop...
ÈÖÓÚÒÆÈ¹ÓÑÔÐØÒ××Ù×ÒÍÒÚÖ×ÐÊÐØÓÒ×ÊÔ...
NP-Completeness Poly time algorithm: input size n (in some encoding), worst case running time – O(nc) for some constant c. Three classes of problems – P: problems solvable in poly time. – NP: prob...
arXiv:cs/0506100v1 [cs.CC] 29 Jun 2005OntheNP-CompletenessofSomeGraphClusterMeasuresˇ ma Jiˇr´ S´InstituteofComputerScience,AcademyofSciencesoftheCzechRepublic,P.O.Box5,18207Prague8,CzechR...
NP-CompletenessofSomeTree-ClusteringProblemsFalkSchreiber andKonstantinosSkodinis UniversityofPassau,94032Passau,Germany{schreiber,skodinis}@informatik.uni-passau.deAbstractAgraphisatreeofpaths(cy...
9991lJu 52 ]CC.sc[ 1v93 7 9/9sc:viXraRaisingNPLowerBoundstoParallelNPLowerBounds EdithHemaspaandra LaneA.Hemaspaandra J¨orgRothe§AbstractAdecadeago,abeautifulpaperbyWagner[Wag87]developeda“t...
第27卷第8期2006年8月湖南科技学院学报JournalofHunanUniversityofScienceandEngineeringV01.27NO.8Aug.2006从配价理论看汉语“VP+fl勺+NP"中NP的省略鲁力进1鲁力达2(1.中南林业科技大学外国语学院,湖南长沙410004;2.北京语言大学外国语学院,北京100000)摘要:本文对句法上能与动词结构同现的名词性结构,即动词的“...