Finance Certifications Goldman Sachs and Amazon Teams Trust
Free courses from frontend to fullstack and AI
Overview
Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This tutorial develops gadget constructions for hardness-of-approximation results for Max 3-LIN and Max-Cut. It introduces Fourier analysis, noisy influences, and the Majority Is Stablest theorem for analyzing these gadgets, without presenting full proofs.
Syllabus
Intro
Max 3 Lin
Max 3 Lin instance
Variables
Optimal solutions
Notation
Fourier analysis
Suggestive F
Formula
Edge weights
Fourier coefficients
G3 and G4
Empty suggestion set
Taught by
Ryan O'Donnell