6.890 | Fall 2014 | Graduate

Algorithmic Lower Bounds: Fun with Hardness Proofs

Lecture Notes

Class on Algorithmic Lower Bounds and Hardness Proofs, Lecture 14 Notes

Description:

This resource contains information related to parameterized complexity II: ETH & planar.

Resource Type:
Lecture Notes
pdf
6 MB
Class on Algorithmic Lower Bounds and Hardness Proofs, Lecture 14 Notes
Download File

Course Info

Instructor

Departments

As Taught In

Fall 2014

Level

Graduate

Topics

Learning Resource Types

Instructor Insights
Lecture Notes
Lecture Videos
Problem Set Solutions
Problem Sets
Projects
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2026 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2026 Massachusetts Institute of Technology