CS 6520 - Computational Complexity Fall 2015
Friday, December 4, 2015
Lecture 43
Last lecture of the fall :(
We covered Shor's algorithm for factoring numbers in quantum polynomial time, best explained in
his paper
.
Older Post
Home