The P=NP problem – hardness statements and runtime lower bounds
- Course:Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
- Discipline:Basic and Health Sciences
- Institute:MIT
- Instructor(s): Prof. Isaac Chuang, Dr. Aram Harrow
- Level:Undergraduate