The replica symmetric phase of random constraint satisfaction problems

Tobias Kapetanopoulos
Tobias Kapetanopoulos
Noëla Müller
Noëla Müller

arXiv: Combinatorics, Volume abs/1802.09311, 2018.

被引用1|引用|浏览2|来源
EI

摘要

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 2...更多

代码

数据

您的评分 :
0

 

标签
评论