Decoding Inference Challenges: Hard vs. Easy Problems in CSPs 🧩

Explore the nuanced boundary between difficult and straightforward inference problems through the lens of Constraint Satisfaction Problems (CSPs) in this insightful talk by Boaz Barak from Harvard. Perfect for enthusiasts of computational complexity and s

Decoding Inference Challenges: Hard vs. Easy Problems in CSPs 🧩
Simons Institute for the Theory of Computing
1.3K views β€’ Aug 24, 2021
Decoding Inference Challenges: Hard vs. Easy Problems in CSPs 🧩

About this video

Boaz Barak (Harvard)
https://simons.berkeley.edu/talks/title-tba-1
Computational Complexity of Statistical Inference Boot Camp

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

1.3K

Likes

21

Duration

55:35

Published

Aug 24, 2021

User Reviews

4.5
(1)
Rate:

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.

Trending Now