On the hardness of sampling independent sets beyond the tree threshold

Design of capacity-approaching irregular low-density parity-check codes

Tom Richardson, Mohammad Amin Shokrollahi, Rüdiger Urbanke · IEEE Transactions on Information Theory · 2001 · 3.4K citations · Full text

Engineering, Communication, Computer Science +17

<i>Spin Glass Theory and Beyond</i>

Marc Mézard, Giorgio Parisi, M. A. Virasoro et al. · Physics Today · 1988 · 2.8K citations

Natural Sciences, Mathematics, Physics +9

Analytic and Algorithmic Solution of Random Satisfiability Problems

Marc Mézard, Giorgio Parisi, Riccardo Zecchina · Science · 2002 · 1.1K citations · Full text

Computing, Computer Science, Mathematics +17

Polynomial-Time Approximation Algorithms for the Ising Model

Mark Jerrum, Alistair Sinclair · SIAM Journal on Computing · 1993 · 579 citations

Computing, Computer Science, Algorithms +16

Counting independent sets up to the tree threshold

Dror Weitz · 2006 · 444 citations

Natural Sciences, Computer Science, Mathematics +13