14. ETH and Planar FPT

2,525 views · Published 14 July 2015 · 1:22:49 · Indexed 26 October 2026

Channel: MIT OpenCourseWare · 2015 · Education

Watch on YouTube

MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014
View the complete course: http://ocw.mit.edu/6-890F14
Instructor: Erik Demaine

In this lecture, Professor Demaine describes strong bounds on running time, assuming the Exponential Time Hypothesis.

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

More from this channel

• 2:12 Team 15: Pre-Flight Interview | MIT Unified Engineering, Fall 2005

  MIT OpenCourseWare

  860 views · 4 February 2008

• 1:36 Team 15: Post-Flight Interview | MIT Unified Engineering, Fall 2005

  MIT OpenCourseWare

  646 views · 4 February 2008

• 1:05 Team 5: Flight Attempt 2 | MIT Unified Engineering, Fall 2005

  MIT OpenCourseWare

  1,563 views · 4 February 2008

• 2:59 Team 5: Pre-Flight Interview | MIT Unified Engineering, Fall 2005

  MIT OpenCourseWare

  2,873 views · 4 February 2008

• 4:06 Two Guys, Two Girls and an Airplane: Flight Attempt 2 | MIT Unified Engineering, Fall 2005

  MIT OpenCourseWare

  900 views · 4 February 2008

• 2:16 Team 9: Pre-Flight Interview | MIT Unified Engineering, Fall 2005

  MIT OpenCourseWare

  744 views · 4 February 2008

• 1:49 Team Firebolt: Pre-Flight Interview | MIT Unified Engineering, Fall 2005

  MIT OpenCourseWare

  835 views · 4 February 2008

• 4:12 Team 15: Flight Attempt | MIT Unified Engineering, Fall 2005

  MIT OpenCourseWare

  2,131 views · 4 February 2008