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
Optimization, Complexity and Math (or, can we prove P != NP using Gradient Descent)
Submitted by
sgriffin
on Wed, 2020-03-18 14:32
Description:
Knuth Prize Lecture, STOC 2019 - June 25, 2019
File:
Video
Date:
2019-06-25
‹ On the nature and future of the Theory of Computation (ToC)
up
P vs. NP Problem: Efficient Computation...Knowledge ›