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
Complexity, Optimization and Math (or, Can we prove that P != NP by gradient descent?)
Submitted by
kphillips
on Tue, 2019-06-25 17:25
Description:
A 1-hour talk given at the Fields Institute, Toronto, Ontario, Canada - May 7, 2019
File:
Video
Date:
2019-05-07