Skip to main content
Avi Wigderson
Personal
CV
Short CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Talks
Expander graphs - applications and combinatorial constructions
Submitted by
smcneil
on Wed, 2012-01-18 10:43
Description:
A 3-hour tutorial, Pseudorandomness in Mathematical Structures Workshop, IAS, Princeton, NJ - June 14-18, 2010
File:
Powerpoint
Video 1
Video 2
Date:
2010-06-14
‹ Elementary open problems in Algebra (with consequences in computational complexity)
up
Expander graphs - where combinatorics and algebra compete and cooperate ›