activity
20072009
most citedEfficient supervised learning in networks with binary synapses

117 citations · 222 across the 4 of their papers we have counts for

collaborators
Showing 2009Show all

1 paper · 1 filter

cond-mat.stat-mech2009★ 24 cited

A rigorous analysis of the cavity equations for the minimum spanning tree

M. Bayati, A. Braunstein, R. Zecchina

We analyze a new general representation for the Minimum Weight Steiner Tree (MST) problem which translates the topological connectivity constraint into a set of local conditions wh…