ConceptTheory & Algos
Finite field
A field is a set of numbers in which we can add, subtract, multiply and divide, with a finite number of elements.
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.
Opens up
Concepts that name this one as a prerequisite.
Schwartz-Zippel lemma4Arithmetization2Reed-Solomon code2Arithmetization of Boolean formulas1Codeword decoding with errors1Diffie-Hellman key exchange1Discrete logarithm problem1Error-correcting codes1Extension field1Extension Field Elements in 1Fermat's little theorem1Finite field extension arithmetic1
Lecturers
2Each in their own terms, from the easiest level.
Michael Sipser
A finite field is a set with elements where is prime, equipped with addition and multiplication operations mod q that satisfy typical field properties.
Lectures that assume it
18The first 12 are shown.
- Communication Complexity of Equality
- Reed Solomon Codes
- Analysis of Boolean Functions: Open Problems
- Revealing XOR-patterns II
- Cryptography: Encryption
- Reed-Solomon Codes
- Multivariate Polynomials and the Schwartz Zippel Lemma
- Error Correcting Codes
- Hamming Code and Hadamard Code
- Razborov Smolensky Lower Bounds for AC0[p]
- The Generalized Discrete Log Problem and the Security of Diffie-Hellman
- Introduction to Elliptic Curves
Connections
29The lectures that define it or assume it, and the concepts next to it.
Concepts9
Show 3 moreShow fewer
Lectures20
- Probabilistic Computation
- Introduction to Galois Fields for the AES
- Communication Complexity of Equality
- Reed Solomon Codes
- Analysis of Boolean Functions: Open Problems
- Revealing XOR-patterns II
Show 14 moreShow fewer
- Cryptography: Encryption
- Reed-Solomon Codes
- Multivariate Polynomials and the Schwartz Zippel Lemma
- Error Correcting Codes
- Hamming Code and Hadamard Code
- Razborov Smolensky Lower Bounds for AC0[p]
- The Generalized Discrete Log Problem and the Security of Diffie-Hellman
- Introduction to Elliptic Curves
- IP = PSPACE
- Non-Prime Fields
- Linear Error Correcting Codes
- Arithmetic Diagonal Cycles and L-Functions
- Non-abelian Motives
- coNP is a Subset of IP