Hardness of Approximation Between P and NP

Channel:
United States Google TechTalks
Subscribers:
348,000
Published on ● Video Link: https://www.youtube.com/watch?v=0V5D1ZnfqXE


Duration: 50:21
1,820 views
12

A Google Algorithms Seminar Talk, 5/18/17, presented by Aviad Rubinstein
Google Algorithms Seminar: Talks from visiting speakers on Algorithms, Theory, and Optimization



Other Videos By Google TechTalks


2017-10-02deBGR: An Efficient and Near Exact Representation of the Weighted deBruijn Graph
2017-10-02Thompson Sampling for Learning in Online Decision Making
2017-09-26Deep Neural Networks in Medical Imaging and Radiology
2017-09-25Zerocash: Addressing Bitcoin's Privacy Problem
2017-08-31Randomized Online Matching in Regular Graphs
2017-08-29Bernoulli Factories and Blackbox Reductions
2017-08-29Applications of Strongly Rayleigh Measures in Counting and Optimization
2017-05-25Learning from Untrusted Data
2017-05-25Computational Aspects of Optimal Information Revelation
2017-05-25Multi-armed Bandit Problems with Strategic Arms
2017-05-25Hardness of Approximation Between P and NP
2017-05-18Assortment Optimization Under a Mixture of Mallows Distribution Over Preferences
2017-04-24JamBoard: The Future of Collaboration at Google and the Enterprise
2017-04-202017 Google Networking Research Summit Keynote Talks
2017-04-19Large-Scale Distributed Virtual World Systems
2017-04-07Technology for Today's Conservationist
2017-03-23Theory, Practice, and Standardization of Eye-tracking Technology
2017-03-03ADHD - Understanding the Superpowers Within
2017-02-16Interpretable Models of Antibiotic Resistance with the Set Covering Machine Algorithm
2017-02-10Where Are the Stars? See How Light Pollution Affects Night Skies
2017-02-02Crystal: Fast as C, Slick as Ruby


Tags:
google techtalks
algorithms