467 citations · 4.2k across the 83 of their papers we have counts for
4 papers · 1 filter
Criticality and Universality in the Unit-Propagation Search Rule
Christophe Deroulers, Rémi Monasson
The probability Psuccess(alpha, N) that stochastic greedy algorithms successfully solve the random SATisfiability problem is studied as a function of the ratio alpha of constraints…
Inferring DNA sequences from mechanical unzipping: an ideal-case study
V. Baldazzi, S. Cocco, E. Marinari +1
We introduce and test a method to predict the sequence of DNA molecules from in silico unzipping experiments. The method is based on Bayesian inference and on the Viterbi decoding…
An algorithm for counting circuits: application to real-world and random graphs
Enzo Marinari, Remi Monasson, Guilhem Semerjian
We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circ…
A generating function method for the average-case analysis of DPLL
Remi Monasson
A method to calculate the average size of Davis-Putnam-Loveland-Logemann (DPLL) search trees for random computational problems is introduced, and applied to the satisfiability of r…