{"product_id":"survey-propagation-methods-von-demian-battaglia","title":"Survey Propagation methods","description":"\u003cp\u003eRandom Constraint Satisfaction Problems (CSPs) are ubiquitous in  computer science and everyday life, including examples ranging  from Sudokus to optimal digital board design. A CSP involves many  discrete variables interacting through random constraints. When the  number of competing conditions gets large, the optimization of a  CSP instance can become extraordinarily hard. The Survey  Propagation algorithm, based on the iterative exchange of simple  probabilistic messages along the edges of a factor graph, succeeds  to optimize even very hard random instances, whereas more  standard algorithms fail dramatically. After a thorough discussion of  the typical-case complexity of the random K-Satisfiability Problem  and of its relation with Statistical Physics, the Survey Propagation  algorithm is introduced and explained in detail, together with some  of its powerful variants and distributed implementations. Beyond  optimization, lossy data compression based on the selective  targeting and retrieval of specific solutions is discussed, thus  showing how Survey Propagation can be used to turn the complexity  itself of hard CSPs resolution into a computational resource of a  novel kind.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783838355931\"\u003e\u003ch3\u003eEfficient optimization and state selection in random Satisfiability problems\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783838355931","offer_id":39499108450397,"sku":"9783838355931","price":59.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/745100e0-4258-4a02-a40c-b54075e51d0e.jpg?v=1757654547","url":"https:\/\/shop.autorenwelt.de\/products\/survey-propagation-methods-von-demian-battaglia","provider":"Autorenwelt Shop","version":"1.0","type":"link"}