Lecture
Linear Algebra Complexity
Related lectures (31)
Simplex Algorithm: TableauMOOC: Optimization: principles and algorithms - Linear optimization
Covers the main idea behind the Simplex algorithm and explains the Tableau method for solving linear programming problems.
Dynamic Programming: Knapsack
Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
Greedy Algorithms & Matroids
Introduces greedy algorithms and matroids, highlighting their efficiency in solving optimization problems.
Algorithmic Complexity: Visualization and Analysis
Explores algorithmic complexity, visualization of functions, and algorithm efficiency analysis using Python.
Algorithmic Complexity: Travel Time Analysis
Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.
Optimization Algorithms
Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.
Algorithmic Complexity: Definition and Examples
Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Decoding Sequence Models: Insights and Beam Search
Explores insights into beam search and decoding sequence models in NLP, emphasizing the cognitive motivation behind search algorithms.
Support Vector Machines: Formulation and Complexity
Explores the formulation and complexity of Support Vector Machines, including primal and dual forms, geometric interpretation, and algorithmic implications.