Modular Arithmetic: Exponentiation Optimization

Related lectures (28)

Page 2 of 3

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Introduces greedy algorithms and matroids, highlighting their efficiency in solving optimization problems.

Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.

Explores the knapsack problem and the traveling salesman problem with a focus on optimization algorithms.

Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.

Covers classical and quantum computational complexity concepts and implications.

Delves into the complexity of factoring polynomials and the implications for security.

Covers number theory, division, remainder, congruence, prime numbers, integer representation, and the Euclidean algorithm.

Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.