Error occured ! We are notified and will try and resolve this as soon as possible.
WARNING! [2] file_put_contents(/home/myedu/domains/myeducationpath.com/app/../html/cache/memory/course_19875_0_e086762d743c0218beb85ea6e1b456cae.txt): Failed to open stream: No such file or directory . Line 75 in file /home/myedu/domains/myeducationpath.com/html/include/class.cache.php. Continue execution. 1585800; index.php; 13.58.252.8; GET; url=courses/19875/algorithmic-lower-bounds-fun-with-hardness-proofs.htm&; ; Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com); ; Executon time: 0 MyEducationPath.com :: MIT OpenCourseWare (OCW) : Algorithmic Lower Bounds: Fun with Hardness Proofs

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).

Tags: Before 1300: Ancient and Medieval HistoryInforInformation environmentsInformation TheoryNutrition
Details: http://ocw.mit.edu/courses/e...th-hardness-proofs-fall-2014
Categories:
Starts : 2014-09-01

Comments

Reviews



-- no reviews yet -- make the first review
Add review [?] Discuss on the Forum

Alternatives
All alternatives to all MIT OpenCourseWare (OCW) courses

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

Add alternative course [?]

Prerequisites

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

Add prerequisite [?]

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.

Add My Exams

Similar courses

Courses related to the course subject

04832430X: Electronic Circuits
0 0

…
Details:https://www.edx.or...onic-circuits-1093

A Gentle Introduction to Programming Using Python (January IAP 2011)
14 0 0

…
Details:http://ocw.mit.edu...n-january-iap-2011

Acoustics of Speech and Hearing
16 0 0

…
Details:http://ocw.mit.edu...-hearing-fall-2004

Acoustics of Speech and Hearing
0 0

…
Details:http://ocw.mit.edu...-hearing-fall-2004

Advanced Algorithms (Fall 2008)
12 0 0

…
Details:http://ocw.mit.edu...gorithms-fall-2008

Advanced Algorithms (Fall 2008)
0 0

…
Details:http://ocw.mit.edu...gorithms-fall-2008

Advanced Circuit Techniques
13 0 0

…
Details:http://ocw.mit.edu...niques-spring-2002

Advanced Data Structures
10 0 0

…
Details:http://ocw.mit.edu...ctures-spring-2012

Advanced Electromagnetism
16 0 0

…
Details:http://ocw.mit.edu...netism-spring-2003

Advanced Natural Language Processing
9 0 0

…
Details:http://ocw.mit.edu...ocessing-fall-2005

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):