47 citations · 136 across the 8 of their papers we have counts for
5 papers · 1 filter
The Easiest Hard Problem: Number Partitioning
Stephan Mertens
Number partitioning is one of the classical NP-hard problems of combinatorial optimization. It has applications in areas like public key encryption and task scheduling. The random…
Threshold values of Random K-SAT from the cavity method
Stephan Mertens, Marc Mezard, Riccardo Zecchina
Using the cavity equations of \cite{mezard:parisi:zecchina:02,mezard:zecchina:02}, we derive the various threshold values for the number of clauses per variable of the random -s…
Pseudo Random Coins Show More Heads Than Tails
Heiko Bauke, Stephan Mertens
Tossing a coin is the most elementary Monte Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enum…
Entropy of Pseudo Random Number Generators
Stephan Mertens, Heiko Bauke
Since the work of Ferrenberg et al.[PRL 69, (1992)] some pseudo random number generators are known to yield wrong results in cluster Monte Carlo simulations. In this contribution t…
Phase Diagram for the Constrained Integer Partitioning Problem
C. Borgs, J. T. Chayes, S. Mertens +1
We consider the problem of partitioning integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minim…