Complexity of Basic Arithmetic || @ CMU || Lecture 7a of CS Theory Toolkit
Time complexity of basic arithmetic operations, especially multiplying two integers. Lecture 7a of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resources for this lecture:
"The Art of Computer Programming, vol. 2, chap. 4.3.3" by Donald Knuth.
"Modern Computer Arithmetic" by Brent and Zimmerman.
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Filmed by Cole H. for Panopto (http://www.panopto.com/)
Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)