实验的渐近复杂性?随机算法的案例研究

{"title":"实验的渐近复杂性?随机算法的案例研究","authors":"P. Sanders, R. Fleischer","doi":"10.1007/3-540-44691-5_12","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":93608,"journal":{"name":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms\",\"authors\":\"P. Sanders, R. Fleischer\",\"doi\":\"10.1007/3-540-44691-5_12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":93608,\"journal\":{\"name\":\"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-44691-5_12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... Workshop on Algorithm Engineering and Experiments : ALENEX","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-44691-5_12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}