Decoding the Challenge: Hard vs. Easy Inference Problems from a CSP Perspective 🔍
Join Boaz Barak from Harvard as he explores the subtle distinctions between hard and easy inference problems through the lens of Constraint Satisfaction Problems (CSPs) in this insightful boot camp lecture on computational complexity.

Simons Institute for the Theory of Computing
814 views • Aug 24, 2021

About this video
Boaz Barak (Harvard)
https://simons.berkeley.edu/talks/title-tba-2
Computational Complexity of Statistical Inference Boot Camp
https://simons.berkeley.edu/talks/title-tba-2
Computational Complexity of Statistical Inference Boot Camp
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
814
Likes
15
Duration
01:14:50
Published
Aug 24, 2021
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.