Video URL

https://simons.berkeley.edu/talks/tbd-270

On the Usefulness of the Strong Exponential Time Hypothesis

(2021). On the Usefulness of the Strong Exponential Time Hypothesis. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/tbd-270

On the Usefulness of the Strong Exponential Time Hypothesis. The Simons Institute for the Theory of Computing, Feb. 18, 2021, https://simons.berkeley.edu/talks/tbd-270 

          @misc{ scivideos_17275,
            doi = {},
            url = {https://simons.berkeley.edu/talks/tbd-270},
            author = {},
            keywords = {},
            language = {en},
            title = {On the Usefulness of the Strong Exponential Time Hypothesis},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2021},
            month = {feb},
            note = {17275 see, \url{https://scivideos.org/Simons-Institute/17275}}
          }
Ryan Williams (MIT)
Source Repository Simons Institute
Subject

Abstract

Over the past 15 years or so, the Strong Exponential Time Hypothesis (SETH) has been very useful for proving conditional hardness for many problems: it's a problem at the heart of fine-grained complexity. In this talk, I will discuss another way in which SETH has been useful.