Interested in online learning?

Edukatico will keep you updated from time to time. (You can stop this at any time.)

Provider: MIT
Go to online course
Transparency note: Some course providers support the operation of our search portal with referral commissions.

Content

This is an online lecture taking a practical approach to proving problems can't be solved efficiently (in polynomial time and assuming standard complexity-theoretic assumptions like P ≠ NP).

MIT

Instructor: Prof. Erik Demaine
Provided by: MIT
Course language: English
Fees: free course
Level: advanced
Certificate available?
Format: video lecture
Go to online course
Transparency note: Some course providers support the operation of our search portal with referral commissions.
You need to accept cookies for external services to see this content.

How do you like the course 'Algorithmic Lower Bounds: Fun with Hardness Proofs'?

Other online courses in Computer Science, IT