The replica symmetric phase of random constraint satisfaction problems
Comb. Probab. Comput., pp. 346-422, 2019.
Random constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark instances for algorithms and they have been harnessed in probabilistic constructions of combinatorial structures with peculiar features. In an important contribution [Krzakala et al., PNAS...More
PPT (Upload PPT)