{"title":"基于调查传播的约束满足","authors":"A. Braunstein, M. Mézard, M. Weigt, R. Zecchina","doi":"10.1093/oso/9780195177374.003.0011","DOIUrl":null,"url":null,"abstract":"Survey Propagation is an algorithm designed for solving typical instances of random constraint satisfiability problems. It has been successfully tested on random 3-SAT and random $G(n,\\frac{c}{n})$ graph 3-coloring, in the hard region of the parameter space. Here we provide a generic formalism which applies to a wide class of discrete Constraint Satisfaction Problems.","PeriodicalId":156167,"journal":{"name":"Computational Complexity and Statistical Physics","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":"{\"title\":\"Constraint Satisfaction by Survey Propagation\",\"authors\":\"A. Braunstein, M. Mézard, M. Weigt, R. Zecchina\",\"doi\":\"10.1093/oso/9780195177374.003.0011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Survey Propagation is an algorithm designed for solving typical instances of random constraint satisfiability problems. It has been successfully tested on random 3-SAT and random $G(n,\\\\frac{c}{n})$ graph 3-coloring, in the hard region of the parameter space. Here we provide a generic formalism which applies to a wide class of discrete Constraint Satisfaction Problems.\",\"PeriodicalId\":156167,\"journal\":{\"name\":\"Computational Complexity and Statistical Physics\",\"volume\":\"107 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"42\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Complexity and Statistical Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/oso/9780195177374.003.0011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Complexity and Statistical Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/oso/9780195177374.003.0011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Survey Propagation is an algorithm designed for solving typical instances of random constraint satisfiability problems. It has been successfully tested on random 3-SAT and random $G(n,\frac{c}{n})$ graph 3-coloring, in the hard region of the parameter space. Here we provide a generic formalism which applies to a wide class of discrete Constraint Satisfaction Problems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
