Explores finite dimensional spaces, covering extraction process, bases generation, and space completion.
Covers the concepts of local homeomorphisms and coverings in manifolds, emphasizing the conditions under which a map is considered a local homeomorphism or a covering.
Covers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
