• Login
    View Item 
    •   SMARTech Home
    • College of Computing (CoC)
    • Algorithms and Randomness Center (ARC)
    • ARC Talks and Events
    • View Item
    •   SMARTech Home
    • College of Computing (CoC)
    • Algorithms and Randomness Center (ARC)
    • ARC Talks and Events
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Genesis of ETH and SETH

    Thumbnail
    View/Open
    paturi.mp4 (564.4Mb)
    paturi_videostream.html (962bytes)
    Date
    2017-02-13
    Author
    Paturi, Ramamohan
    Metadata
    Show full item record
    Abstract
    Several researchers have found ETH (Exponential Time Hypothesis) and Strong ETH to be useful and proved matching lower bounds for several problems in P as well as NP based on these conjectures. In this talk, I will talk about the technical results that motivated these conjectures. Specifically, I will talk about the following results: if ETH is false then a number of other NP-complete problems (the class SNP) will also have subexponential time algorithms, and the complexity of k-SAT must keep increasing with k under ETH. While these results are old, the latter result is relatively less well-known and I hope that it might inspire more work along the lines.
    URI
    http://hdl.handle.net/1853/56481
    Collections
    • ARC Talks and Events [88]

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CollectionDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Statistics

    View Usage StatisticsView Google Analytics Statistics
    facebook instagram twitter youtube
    • My Account
    • Contact us
    • Directory
    • Campus Map
    • Support/Give
    • Library Accessibility
      • About SMARTech
      • SMARTech Terms of Use
    Georgia Tech Library266 4th Street NW, Atlanta, GA 30332
    404.894.4500
    • Emergency Information
    • Legal and Privacy Information
    • Human Trafficking Notice
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    © 2020 Georgia Institute of Technology