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
Elementary mathematical problems implying computational hardness
Submitted by
dloring
on Fri, 2016-01-22 00:00
Description:
Noga Alon's 60th birthday conference, Tel Aviv, Israel - January 20, 2016
File:
Powerpoint
Date:
2016-01-20
‹ Direct-product testing, and a new 2-query PCP
up
Elementary open problems in Algebra (with consequences in computational complexity) ›