Deck · IOI — Competitive Programming

Linear Algebra & FFT for Competitive Programming

Matrices and matrix exponentiation, linear recurrences, Gaussian elimination, rank and determinant, XOR linear basis, polynomials, DFT/FFT, NTT, convolution applications, and the Matrix-Tree theorem for the IOI.

60 cards · audited · SM-2 spaced repetition

or go All-Access →

Included with the full IOI — Competitive Programming program — 14 decks, 964 cards.

Sample cards

Matrix

Matrix addition

Matrix multiplication definition

Matrix multiplication is associative but not commutative

Naive matrix multiplication cost

Showing 5 of 60 cards. Unlock the program to study them all.

More in IOI — Competitive Programming

Advanced Computational Geometry49 cards Advanced Graph Algorithms, Flows & Matching63 cards General Algorithmic Techniques & Analysis79 cards Combinatorics & Counting66 cards Fundamental Data Structures78 cards Dynamic Programming81 cards

Master linear algebra & fft for competitive programming — and the rest of IOI — Competitive Programming.

One program. 964 audited cards across 14 decks.

or go All-Access →

See the full program →