ConceptTheory & Algos
Integer multiplication time M(n)
M(n) represents the time complexity for multiplying two n-bit integers, which is in the word RAM model or in circuits or Turing machine models.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.