Lectures related to Tetration | EPFL Graph Search

Explores windowing exponentiation with base-B representation and precomputed small powers of x for efficient computation.

Covers prime numbers, primality testing algorithms, modular arithmetic, and efficient exponentiation methods.

Showcases examples of complex numbers in polar form and their operations.

Covers regular languages, encoding, alphabets, words, languages, concatenation, exponentiation, and iterative closure.

Explores optimizing exponentiation in modular arithmetic for efficient calculations and prime number determination.

Covers exponentiation, RSA encryption, big integer multiplication, and primitive roots.

Explains the definitions and properties of powers and roots in algebra.

Explores cyclic groups, generators, isomorphisms, and the discrete logarithm problem in depth, highlighting their importance and applications.

Explores defining arithmetic operations through counting, with insights on cardinal numbers, Cantor's work, and Sudoku.

Covers operations with complex numbers and convergence of functions as x approaches 0.

Covers Barrett reduction, Montgomery form of integers, and efficient Montgomery product computation.

Covers the fast exponentiation algorithm and its time complexity, prime number properties, and the El-Gamal encryption scheme.

Introduces recursive algorithms for factorial, exponentiation, and search.

Explores finding the equation of the tangent line to a function's graph at a point.

Covers commutative groups and their significance in cryptography.

Explains recursive algorithms for factorial, exponentiation, and search problems.

Covers mathematical induction, recursively defined functions, and iterative algorithms for problem-solving.

Explores power functions with functions as base and exponent, emphasizing exponential function continuity and derivative analysis.

Covers the properties of exponential and logarithmic functions.

Covers properties and notation of the trivial group and discusses the uniqueness of elements.