Filters: Author is Mézard, Marc [Clear All Filters]
Analytic and Algorithmic Solution of Random Satisfiability Problems. Science. 2002;297(5582):812-5.
Clustering of Solutions in the Random Satisfiability Problem. Physical Review Letters. 2005;94:197205.
Message-Passing Algorithms for Non-Linear Nodes and Data Compression. ComPlexUs. 2006;3:58-65.
Pairs of SAT Assignments and Clustering in Random Boolean Formulae. Theoretical Computer Science. 2008;393:260-79.
Random K-satisfiability problem: From an analytic solution to an efficient algorithm. Physical Review E. 2002;66:56126.
Random K-satisfiability: from an analytic solution to a new efficient algorithm. Phys. Rev. E. 2002;66:056126.
Survey Propagation: an algorithm for satisfiability. Random Structures and Algorithms. 2005;27:201-26.
Survey-propagation decimation through distributed local computations. J. Stat. Mech.. 2005:P11016.
Threshold values of random K-SAT from the cavity method. Random Structures and Algorithms. 2006;28:340.
Two Solutions to Diluted p-Spin Models and XORSAT Problems. Journal of Statistical Physics. 2003;111:505-33.
Two solutions to diluted p-spin models and XORSAT problems. J. Stat. Phys.. 2002;111:505.