一个kCSP实例的随机解离最坏解有多远?

{"title":"一个kCSP实例的随机解离最坏解有多远?","authors":"Jean-François Culus, S. Toulouse","doi":"10.1007/978-3-319-94667-2_31","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?\",\"authors\":\"Jean-François Culus, S. Toulouse\",\"doi\":\"10.1007/978-3-319-94667-2_31\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":403593,\"journal\":{\"name\":\"International Workshop on Combinatorial Algorithms\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Combinatorial Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-94667-2_31\",\"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 on Combinatorial Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-94667-2_31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}