![Computational Complexity of Statistical Inference_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-03/Computational%20Complexity%20of%20Statistical%20Inference_hi-res.jpg?h=ccd3d9f7&itok=qCiIzWU5)
Description
Recovering the hidden vertex correspondence between two edge-correlated random graphs offers a rich set of problems involving the interplay of algorithms, complexity, and information limits. This talk will present an overview and recent results on this topic.
All scheduled dates:
Upcoming
No Upcoming activities yet