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
P vs. NP Problem: Efficient Computation...Knowledge
Submitted by
dloring
on Thu, 2017-03-09 17:03
Description:
Institute for Advanced Study, Princeton, New Jersey - May 16, 2016
File:
Video
Date:
2016-05-16
‹ Optimization, Complexity and Math (or, can we prove P != NP using Gradient Descent)
up
Perfect Matchings and Symbolic Matrices ›