Interested in online learning?

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


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


Teacher: Prof. Erik Demaine
Provided by: MIT
Course language: English
Fees: free course
Level: advanced
Certificate possible?
Format: video lecture

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

Other online courses in Computer Science, IT