Algorithmic Lower Bounds: Fun with Hardness Proofs

0 votes
Free
Algorithmic Lower Bounds: Fun with Hardness Proofs

6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs is a class taking a practical approach to proving problems can't be solved efficiently (in polynomial time and assuming standard complexity-theoretic assumptions like P ≠ NP). The class focuses on reductions and techniques for proving problems are computationally hard for a variety of complexity classes. Along the way, the class will create many interesting gadgets, learn many hardness proof styles, explore the connection between games and computation, survey several important problems and complexity classes, and crush hopes and dreams (for fast optimal solutions).

Categories:
Starts : 2014-09-01

Comments

Alternatives

-- no alternatives found for the course --
If you know any alternatives, please let us know.

Prerequisites

-- no prerequsites found for the course --
If you can suggest any prerequisite, please let us know.

Paths

No Paths inclusing the course. You can build and share a path with this course included.

Certification Exams

-- there are no exams to get certification after this course --
If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory.

Similar courses

Courses related to the course subject

This course is taught in Mandarin. A basic EE course for the general MOOCer about circuits and multiple-disciplinary case studies.

14 0 0

This course will provide a gentle, yet intense, introduction to programming using Python for highly motivated students with little…

16 0 0

The Acoustics of Speech and Hearing is an H-Level graduate course that reviews the physical processes involved in the production,…

The Acoustics of Speech and Hearing is an H-Level graduate course that reviews the physical processes involved in the production,…

12 0 0

This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introd…

This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introd…

13 0 0

Following a brief classroom discussion of relevant principles, each student in this course completes the paper design of several a…

10 0 0

Data structures play a central role in modern computer science. You interact with data structures even more often than with algori…

16 0 0

In 6.635, topics covered include: special relativity, electrodynamics of moving media, waves in dispersive media, microstrip integ…

9 0 0

This course is a graduate introduction to natural language processing - the study of human language from a computational perspecti…

Let us know when you did the course Algorithmic Lower Bounds: Fun with Hardness Proofs.

Started on: Completed on:
Your grade (if any):
Comments:

Add the course Algorithmic Lower Bounds: Fun with Hardness Proofs to My Personal Education Path.

Start the course on:
Duration of study:
Notes:

Successfully added to your path.

View your path

Select what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.


Notes about how the exam certifies students of the course (optional):