Sign inSign in

Integer multiplication time M(n)

M(n) represents the time complexity for multiplying two n-bit integers, which is O(n)O(n) in the word RAM model or O(nlog⁡n)O(n \log n) in circuits or Turing machine models.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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.

Asymptotic notation1Integer multiplication1Turing machine models1

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.