Algorithms & Growth of Functions

Related lectures (18)

Page 1 of 2

Introduces Cartesian product and induction for proofs using integers and sets.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Covers weak derivatives, their properties, and applications in functional analysis.

Explores mapping functions, surjections, injective and surjective functions, and bijective functions.

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.

Introduces differential forms on manifolds, covering tangent bundles and intersection pairings.

Covers the generalities of functions, including the definition of an application between sets and the uniqueness of elements in the image set.

Covers the concept of graph sketching with a focus on connected components.

Covers the basics of sets and operations in mathematics, from set properties to advanced operations.