Skip to main content
Avi Wigderson
Personal
Short Bio
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
Proof, Computation and Randomness
Submitted by
smcneil
on Wed, 2012-01-18 10:31
Description:
at National Science Foundation, Arlington, VA - September 27, 2007.
File:
Powerpoint
Date:
2007-09-27
‹ Proof complexity - an introduction
up
Proving Algebraic Identities ›