{"title":"布尔矩阵积见证的几乎最优(平均)组合算法,计算直径(扩展摘要)","authors":"C. Schnorr, C. Subramanian","doi":"10.1007/3-540-49543-6_18","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":423704,"journal":{"name":"International Workshop Randomization and Approximation Techniques in Computer Science","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract)\",\"authors\":\"C. Schnorr, C. Subramanian\",\"doi\":\"10.1007/3-540-49543-6_18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":423704,\"journal\":{\"name\":\"International Workshop Randomization and Approximation Techniques in Computer Science\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop Randomization and Approximation Techniques in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-49543-6_18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop Randomization and Approximation Techniques in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-49543-6_18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}