Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

A Tight Analysis of Bethe Approximation for Permanent

IEEE via YouTube

Overview

Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Explore a rigorous analysis of the Bethe approximation for permanent in this 23-minute IEEE conference talk. Delve into the problem, its approximation history, and various approximation factors. Learn about better approximation techniques, including the Beta approximation, and understand the distribution on perfect matchings and trees. Examine upper bounds and gain insights into both good and bad approximation methods. Presented by Nima Anari and Alireza Rezaei, this talk provides a comprehensive overview of the topic, from introduction to summary.

Syllabus

Introduction
The Problem
Approximation History
Approximation Factors
Better Approximation
Beta Approximation
Bad Approximation
Distribution on Perfect Matchings
Distribution on Trees
Upper Bounds
Summary

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of A Tight Analysis of Bethe Approximation for Permanent

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.