ARC Colloquium: Ramamohan Paturi (UCSD)

Algorithms & Randomness Center (ARC)

Ramamohan Paturi (UCSD)

Monday, February 13, 2017

Klaus 1116 East - 11:00 am

Title: Genesis of ETH and SETH

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.  


Speaker's webpage:

Videos of recent talks are available at:

Click here to subscribe to the ARC Colloquium mailing list.

Event Details


  • Monday, February 13, 2017
    11:00 am - 12:00 pm
Location: Klaus 1116 East

For More Information Contact

Eric Vigoda