Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Asymptotic computational complexity

Related lectures (27)

Complexity of Algorithms

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Parallel Programming in Scala: Performance Analysis

Delves into the performance analysis of parallel programs in Scala, covering asymptotic analysis, recursive functions, and Amdahl's Law.

Algorithm Design: Time Complexity Analysis

Introduces algorithm design and time complexity analysis using examples and notations like n² and O(n).

Optimization: Classical Problems

Covers classical optimization problems, brute force algorithms, and integer linear optimization.

Efficiency of Algorithms

Explores the efficiency of algorithms and the impact of complexity on computation time.

Algorithmic Complexity: Travel Time Analysis

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

P vs NP: Complexity Theory

Delves into complexity theory, focusing on the P vs NP problem and the classification of computational problems based on efficiency.

Ruelle resonances for geodesic flow

Explores Ruelle resonances for geodesic flows on non-compact manifolds, emphasizing the role of smoothness and eigenvalues in the dynamics.

Introduction to Complexity

Introduces time complexity and worst-case analysis of algorithms, abstracting computational complexity from implementation details.

Introduction to Complexity

Introduces time complexity and worst-case analysis of algorithms, abstracting computational complexity from implementation details.

Complexity of Algorithms

Explores the complexity of algorithms, including big-O notation and efficiency analysis.

Complexity Analysis of FGD Algorithm

Analyzes the complexity of the FGD algorithm in terms of computational and memory requirements.

Quantum Phase Estimation

Explains the Quantum Phase Estimation (QPE) algorithm and its complexity using two registers and SWAP gates.

Theory of Computation: Complexity of Problems

Explores the theory of computation, undecidable problems, complexity measurement, and the P complexity class.

Complexity Classes: P and NP

Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.

Master Theorem: Time Complexity Analysis

Introduces the Master Theorem for analyzing algorithm time complexity through problem subdivision and formula application.

Poles and Values: Simplification Techniques

Covers the correction of an intermediate test, suggestions for the exam, and simplification techniques of poles and values.

Comparing Functions MOOC: Analysis I MOOC: Analysis I (part 6) : Study of functions, limited developments

Explores using Bernoulli de l'Hospital's theorem to compare functions' asymptotic behavior.

Search Algorithms: Dichotomy Search

Explores dichotomy search algorithms, analyzing complexity and implementation details for efficient searching in sorted lists.

Subquadratic Attention Mechanisms: State Space Models Overview Log in to Mediaspace to watch this video

Covers subquadratic attention mechanisms and state space models, focusing on their theoretical foundations and practical implementations in machine learning.